Base | Representation |
---|---|
bin | 101011110110011000100… |
… | …101011000110001000111 |
3 | 101200001221021210122220011 |
4 | 223312120211120301013 |
5 | 343332300443341403 |
6 | 10224150002451051 |
7 | 430464114330040 |
oct | 53663045306107 |
9 | 11601837718804 |
10 | 3013332012103 |
11 | a61a463aa7a6 |
12 | 408006963a87 |
13 | 18b20492a46a |
14 | a5bbb7a98c7 |
15 | 535b4dc9a6d |
hex | 2bd98958c47 |
3013332012103 has 4 divisors (see below), whose sum is σ = 3443808013840. Its totient is φ = 2582856010368.
The previous prime is 3013332012013. The next prime is 3013332012179. The reversal of 3013332012103 is 3012102333103.
3013332012103 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3013332012103 - 217 = 3013331881031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013332012203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 215238000858 + ... + 215238000871.
It is an arithmetic number, because the mean of its divisors is an integer number (860952003460).
Almost surely, 23013332012103 is an apocalyptic number.
3013332012103 is a deficient number, since it is larger than the sum of its proper divisors (430476001737).
3013332012103 is an equidigital number, since it uses as much as digits as its factorization.
3013332012103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430476001736.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3013332012103 its reverse (3012102333103), we get a palindrome (6025434345206).
The spelling of 3013332012103 in words is "three trillion, thirteen billion, three hundred thirty-two million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •