Base | Representation |
---|---|
bin | 101110101101101110110… |
… | …101001010011000000001 |
3 | 102100220002100122122111100 |
4 | 232231232311022120001 |
5 | 410043442200000001 |
6 | 10454425011005013 |
7 | 450633514530321 |
oct | 56555665123001 |
9 | 12326070578440 |
10 | 3210200000001 |
11 | 1028490234945 |
12 | 43a1a9599769 |
13 | 1a394a0c3827 |
14 | b153591d281 |
15 | 587883d0586 |
hex | 2eb6ed4a601 |
3210200000001 has 24 divisors (see below), whose sum is σ = 4648354794720. Its totient is φ = 2134872881856.
The previous prime is 3210199999987. The next prime is 3210200000027. The reversal of 3210200000001 is 1000000020123.
It is a happy number.
3210200000001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3210200000001 - 27 = 3210199999873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (3210200000071) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81950646 + ... + 81989808.
It is an arithmetic number, because the mean of its divisors is an integer number (193681449780).
Almost surely, 23210200000001 is an apocalyptic number.
It is an amenable number.
3210200000001 is a deficient number, since it is larger than the sum of its proper divisors (1438154794719).
3210200000001 is a wasteful number, since it uses less digits than its factorization.
3210200000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61325 (or 61322 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 3210200000001 its reverse (1000000020123), we get a palindrome (4210200020124).
The spelling of 3210200000001 in words is "three trillion, two hundred ten billion, two hundred million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •