Base | Representation |
---|---|
bin | 101011110011010010110… |
… | …001100011010001101111 |
3 | 101122202101000002020100122 |
4 | 223303102301203101233 |
5 | 343304001401441421 |
6 | 10222440411315155 |
7 | 430315636001621 |
oct | 53632261432157 |
9 | 11582330066318 |
10 | 3010013312111 |
11 | a605a3053333 |
12 | 40743b44babb |
13 | 18aac61cb660 |
14 | a5984b22c11 |
15 | 5346d8812ab |
hex | 2bcd2c6346f |
3010013312111 has 16 divisors (see below), whose sum is σ = 3412402005600. Its totient is φ = 2632052320128.
The previous prime is 3010013312107. The next prime is 3010013312167. The reversal of 3010013312111 is 1112133100103.
It is a cyclic number.
It is not a de Polignac number, because 3010013312111 - 22 = 3010013312107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3010013312111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3010013312171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3130625 + ... + 3977541.
It is an arithmetic number, because the mean of its divisors is an integer number (213275125350).
Almost surely, 23010013312111 is an apocalyptic number.
3010013312111 is a deficient number, since it is larger than the sum of its proper divisors (402388693489).
3010013312111 is a wasteful number, since it uses less digits than its factorization.
3010013312111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861338.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 3010013312111 its reverse (1112133100103), we get a palindrome (4122146412214).
The spelling of 3010013312111 in words is "three trillion, ten billion, thirteen million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •