Base | Representation |
---|---|
bin | 1001000110010100010111… |
… | …1111010001000011010001 |
3 | 1022102101110121220210211022 |
4 | 2101211011333101003101 |
5 | 2302402001134421301 |
6 | 33135502223125225 |
7 | 2051530144552640 |
oct | 221450577210321 |
9 | 38371417823738 |
10 | 10004153045201 |
11 | 320781264a387 |
12 | 1156a56743815 |
13 | 5775066a3c13 |
14 | 2682bc921357 |
15 | 12536e849d1b |
hex | 91945fd10d1 |
10004153045201 has 8 divisors (see below), whose sum is σ = 11452598239104. Its totient is φ = 8560527969600.
The previous prime is 10004153045119. The next prime is 10004153045213. The reversal of 10004153045201 is 10254035140001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10004153045201 is a prime.
It is a super-3 number, since 3×100041530452013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10004153045221) 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, 1205025125 + ... + 1205033426.
It is an arithmetic number, because the mean of its divisors is an integer number (1431574779888).
Almost surely, 210004153045201 is an apocalyptic number.
It is an amenable number.
10004153045201 is a deficient number, since it is larger than the sum of its proper divisors (1448445193903).
10004153045201 is an equidigital number, since it uses as much as digits as its factorization.
10004153045201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2410059151.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10004153045201 its reverse (10254035140001), we get a palindrome (20258188185202).
The spelling of 10004153045201 in words is "ten trillion, four billion, one hundred fifty-three million, forty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •