Base | Representation |
---|---|
bin | 101110100100001110110… |
… | …111101110000011101001 |
3 | 102022220202111210012211021 |
4 | 232210032313232003221 |
5 | 404412100012414423 |
6 | 10450020524132441 |
7 | 450122662153033 |
oct | 56441667560351 |
9 | 12286674705737 |
10 | 3200000123113 |
11 | 1024126711422 |
12 | 438221697121 |
13 | 1a29b2b93111 |
14 | b0c4900ac53 |
15 | 5838cbde95d |
hex | 2e90edee0e9 |
3200000123113 has 4 divisors (see below), whose sum is σ = 3303225933568. Its totient is φ = 3096774312660.
The previous prime is 3200000123083. The next prime is 3200000123119. The reversal of 3200000123113 is 3113210000023.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3200000123113 - 217 = 3199999992041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3200000123119) 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 3 ways as a sum of consecutive naturals, for example, 51612905181 + ... + 51612905242.
It is an arithmetic number, because the mean of its divisors is an integer number (825806483392).
Almost surely, 23200000123113 is an apocalyptic number.
It is an amenable number.
3200000123113 is a deficient number, since it is larger than the sum of its proper divisors (103225810455).
3200000123113 is a wasteful number, since it uses less digits than its factorization.
3200000123113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103225810454.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 3200000123113 its reverse (3113210000023), we get a palindrome (6313210123136).
The spelling of 3200000123113 in words is "three trillion, two hundred billion, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •