Base | Representation |
---|---|
bin | 101111000000011110001… |
… | …101011000111010101001 |
3 | 102102211000201011222220020 |
4 | 233000132031120322221 |
5 | 410411144442424001 |
6 | 10511553424151053 |
7 | 452245252635543 |
oct | 57003615307251 |
9 | 12384021158806 |
10 | 3230322233001 |
11 | 1035a76760376 |
12 | 442084468489 |
13 | 1a5805bc7886 |
14 | b24c4142693 |
15 | 59064c43736 |
hex | 2f01e358ea9 |
3230322233001 has 16 divisors (see below), whose sum is σ = 4352461365120. Its totient is φ = 2130918814080.
The previous prime is 3230322232993. The next prime is 3230322233009. The reversal of 3230322233001 is 1003322230323.
3230322233001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3230322232993) and next prime (3230322233009).
It is not a de Polignac number, because 3230322233001 - 23 = 3230322232993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3230322233009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6404860 + ... + 6890781.
It is an arithmetic number, because the mean of its divisors is an integer number (272028835320).
Almost surely, 23230322233001 is an apocalyptic number.
It is an amenable number.
3230322233001 is a deficient number, since it is larger than the sum of its proper divisors (1122139132119).
3230322233001 is a wasteful number, since it uses less digits than its factorization.
3230322233001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13296496.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 3230322233001 its reverse (1003322230323), we get a palindrome (4233644463324).
The spelling of 3230322233001 in words is "three trillion, two hundred thirty billion, three hundred twenty-two million, two hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •