Base | Representation |
---|---|
bin | 101110100101010001110… |
… | …100011001000011011011 |
3 | 102100000122210021201221200 |
4 | 232211101310121003123 |
5 | 404421400032332443 |
6 | 10450324210205243 |
7 | 450162551206404 |
oct | 56452164310333 |
9 | 12300583251850 |
10 | 3201123324123 |
11 | 1024652732a1a |
12 | 438495883823 |
13 | 1a2b317a81ba |
14 | b0d142689ab |
15 | 58406609dd3 |
hex | 2e951d190db |
3201123324123 has 36 divisors (see below), whose sum is σ = 4704010693200. Its totient is φ = 2097702999360.
The previous prime is 3201123324101. The next prime is 3201123324143. The reversal of 3201123324123 is 3214233211023.
3201123324123 is a `hidden beast` number, since 3 + 2 + 0 + 11 + 233 + 2 + 412 + 3 = 666.
3201123324123 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 3201123324123 - 212 = 3201123320027 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3201123324143) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 51642553 + ... + 51704501.
It is an arithmetic number, because the mean of its divisors is an integer number (130666963700).
Almost surely, 23201123324123 is an apocalyptic number.
3201123324123 is a deficient number, since it is larger than the sum of its proper divisors (1502887369077).
3201123324123 is a wasteful number, since it uses less digits than its factorization.
3201123324123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63620 (or 63556 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 3201123324123 its reverse (3214233211023), we get a palindrome (6415356535146).
The spelling of 3201123324123 in words is "three trillion, two hundred one billion, one hundred twenty-three million, three hundred twenty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •