Base | Representation |
---|---|
bin | 101110100101010001001… |
… | …001101100000111100111 |
3 | 102100000122000020000112101 |
4 | 232211101021230013213 |
5 | 404421334201130043 |
6 | 10450323130232531 |
7 | 450162354104503 |
oct | 56452111540747 |
9 | 12300560200471 |
10 | 3201112130023 |
11 | 10246473876a5 |
12 | 438491b85747 |
13 | 1a2b2c388c82 |
14 | b0d12993303 |
15 | 5840564824d |
hex | 2e95126c1e7 |
3201112130023 has 8 divisors (see below), whose sum is σ = 3277216386000. Its totient is φ = 3125736144768.
The previous prime is 3201112129979. The next prime is 3201112130039. The reversal of 3201112130023 is 3200312111023.
3201112130023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3201112130023 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 (3201112130053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182058786 + ... + 182076367.
It is an arithmetic number, because the mean of its divisors is an integer number (409652048250).
Almost surely, 23201112130023 is an apocalyptic number.
3201112130023 is a deficient number, since it is larger than the sum of its proper divisors (76104255977).
3201112130023 is a wasteful number, since it uses less digits than its factorization.
3201112130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364135361.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3201112130023 its reverse (3200312111023), we get a palindrome (6401424241046).
The spelling of 3201112130023 in words is "three trillion, two hundred one billion, one hundred twelve million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •