Base | Representation |
---|---|
bin | 10111011111011001111011… |
… | …001011110011110000010001 |
3 | 111112210122110020111221110211 |
4 | 113133121323023303300101 |
5 | 102020140423231443441 |
6 | 1003421233344124121 |
7 | 30522063440553166 |
oct | 2737317313636021 |
9 | 445718406457424 |
10 | 103313210031121 |
11 | 2aa11982769042 |
12 | b706961006641 |
13 | 45855175334bc |
14 | 1b7255944a06d |
15 | be26312b0a81 |
hex | 5df67b2f3c11 |
103313210031121 has 16 divisors (see below), whose sum is σ = 108947643280960. Its totient is φ = 97698492610560.
The previous prime is 103313210031107. The next prime is 103313210031133. The reversal of 103313210031121 is 121130012313301.
It is a cyclic number.
It is not a de Polignac number, because 103313210031121 - 213 = 103313210022929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103313210031092 and 103313210031101.
It is not an unprimeable number, because it can be changed into a prime (103313210031221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 144101866 + ... + 144817036.
It is an arithmetic number, because the mean of its divisors is an integer number (6809227705060).
Almost surely, 2103313210031121 is an apocalyptic number.
It is an amenable number.
103313210031121 is a deficient number, since it is larger than the sum of its proper divisors (5634433249839).
103313210031121 is a wasteful number, since it uses less digits than its factorization.
103313210031121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 728944.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 103313210031121 its reverse (121130012313301), we get a palindrome (224443222344422).
The spelling of 103313210031121 in words is "one hundred three trillion, three hundred thirteen billion, two hundred ten million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •