Base | Representation |
---|---|
bin | 1001001000011010010111… |
… | …0011111101101000110001 |
3 | 1022112211022020220102121210 |
4 | 2102012211303331220301 |
5 | 2303444131312330301 |
6 | 33204211225110333 |
7 | 2054242354402305 |
oct | 222064563755061 |
9 | 38484266812553 |
10 | 10040120433201 |
11 | 3220a9a26a331 |
12 | 1161a140283a9 |
13 | 57aa19156c21 |
14 | 269d316c9d05 |
15 | 1262772b8ad6 |
hex | 921a5cfda31 |
10040120433201 has 8 divisors (see below), whose sum is σ = 13445285006080. Its totient is φ = 6664184741232.
The previous prime is 10040120433191. The next prime is 10040120433223. The reversal of 10040120433201 is 10233402104001.
10040120433201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10040120433201 - 234 = 10022940564017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10040120435201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7307219425 + ... + 7307220798.
It is an arithmetic number, because the mean of its divisors is an integer number (1680660625760).
Almost surely, 210040120433201 is an apocalyptic number.
It is an amenable number.
10040120433201 is a deficient number, since it is larger than the sum of its proper divisors (3405164572879).
10040120433201 is a wasteful number, since it uses less digits than its factorization.
10040120433201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14614440455.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10040120433201 its reverse (10233402104001), we get a palindrome (20273522537202).
The spelling of 10040120433201 in words is "ten trillion, forty billion, one hundred twenty million, four hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •