Base | Representation |
---|---|
bin | 101111000000010001110… |
… | …000000100110110000111 |
3 | 102102210111010220010201220 |
4 | 233000101300010312013 |
5 | 410410232441101043 |
6 | 10511521000251423 |
7 | 452240134241232 |
oct | 57002160046607 |
9 | 12383433803656 |
10 | 3230113222023 |
11 | 1035979783326 |
12 | 442026470b73 |
13 | 1a57a1806c3c |
14 | b24a4496419 |
15 | 59051709483 |
hex | 2f011c04d87 |
3230113222023 has 16 divisors (see below), whose sum is σ = 4646200598496. Its totient is φ = 1988497372160.
The previous prime is 3230113222003. The next prime is 3230113222027. The reversal of 3230113222023 is 3202223110323.
It is a cyclic number.
It is not a de Polignac number, because 3230113222023 - 217 = 3230113090951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3230113221984 and 3230113222002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230113222027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 597502518 + ... + 597507923.
It is an arithmetic number, because the mean of its divisors is an integer number (290387537406).
Almost surely, 23230113222023 is an apocalyptic number.
3230113222023 is a deficient number, since it is larger than the sum of its proper divisors (1416087376473).
3230113222023 is a wasteful number, since it uses less digits than its factorization.
3230113222023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1195010514.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 3230113222023 its reverse (3202223110323), we get a palindrome (6432336332346).
The spelling of 3230113222023 in words is "three trillion, two hundred thirty billion, one hundred thirteen million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •