Base | Representation |
---|---|
bin | 1001010011100110101101… |
… | …1011001111100110111001 |
3 | 1100020012122112221012222021 |
4 | 2110321223123033212321 |
5 | 2320121441041344001 |
6 | 33432412320154441 |
7 | 2104160524232050 |
oct | 224715333174671 |
9 | 40205575835867 |
10 | 10232414403001 |
11 | 32955a7198a2a |
12 | 119313aa68a21 |
13 | 592bb2acc0cb |
14 | 275374187397 |
15 | 12b27de5eba1 |
hex | 94e6b6cf9b9 |
10232414403001 has 8 divisors (see below), whose sum is σ = 11694286794560. Its totient is φ = 8770566737808.
The previous prime is 10232414402999. The next prime is 10232414403023. The reversal of 10232414403001 is 10030441423201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10232414403001 - 21 = 10232414402999 is a prime.
It is a super-2 number, since 2×102324144030012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10202414403001) 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, 5286171 + ... + 6957616.
It is an arithmetic number, because the mean of its divisors is an integer number (1461785849320).
Almost surely, 210232414403001 is an apocalyptic number.
It is an amenable number.
10232414403001 is a deficient number, since it is larger than the sum of its proper divisors (1461872391559).
10232414403001 is a wasteful number, since it uses less digits than its factorization.
10232414403001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12363183.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10232414403001 its reverse (10030441423201), we get a palindrome (20262855826202).
The spelling of 10232414403001 in words is "ten trillion, two hundred thirty-two billion, four hundred fourteen million, four hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •