Base | Representation |
---|---|
bin | 101110100101010111001… |
… | …011001111011010011000 |
3 | 102100000220001101220111202 |
4 | 232211113023033122120 |
5 | 404422041034400044 |
6 | 10450341140413332 |
7 | 450165022144310 |
oct | 56452713173230 |
9 | 12300801356452 |
10 | 3201213200024 |
11 | 102469943a024 |
12 | 4384bb9a7248 |
13 | 1a2b472b57c8 |
14 | b0d22182440 |
15 | 5840e45ec4e |
hex | 2e9572cf698 |
3201213200024 has 64 divisors (see below), whose sum is σ = 6868725998400. Its totient is φ = 1370153078784.
The previous prime is 3201213200023. The next prime is 3201213200033. The reversal of 3201213200024 is 4200023121023.
It is a junction number, because it is equal to n+sod(n) for n = 3201213199969 and 3201213200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201213200023) 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 15 ways as a sum of consecutive naturals, for example, 139920074 + ... + 139942950.
It is an arithmetic number, because the mean of its divisors is an integer number (107323843725).
Almost surely, 23201213200024 is an apocalyptic number.
It is an amenable number.
3201213200024 is an abundant number, since it is smaller than the sum of its proper divisors (3667512798376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3201213200024 is a wasteful number, since it uses less digits than its factorization.
3201213200024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26052 (or 26048 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 3201213200024 its reverse (4200023121023), we get a palindrome (7401236321047).
The spelling of 3201213200024 in words is "three trillion, two hundred one billion, two hundred thirteen million, two hundred thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •