Base | Representation |
---|---|
bin | 1001001101110001000000… |
… | …1110111110001011001001 |
3 | 1022212121201111002021212122 |
4 | 2103130100032332023021 |
5 | 2312001020123231101 |
6 | 33314342251021025 |
7 | 2064006613536050 |
oct | 223342016761311 |
9 | 38777644067778 |
10 | 10132100211401 |
11 | 3256aaa476053 |
12 | 1177803a3a775 |
13 | 5865b719319c |
14 | 2705794db397 |
15 | 12885c36151b |
hex | 937103be2c9 |
10132100211401 has 8 divisors (see below), whose sum is σ = 12188992735680. Its totient is φ = 8227570096368.
The previous prime is 10132100211391. The next prime is 10132100211407. The reversal of 10132100211401 is 10411200123101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10132100211401 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10132100211401.
It is not an unprimeable number, because it can be changed into a prime (10132100211407) 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, 38090602166 + ... + 38090602431.
It is an arithmetic number, because the mean of its divisors is an integer number (1523624091960).
Almost surely, 210132100211401 is an apocalyptic number.
It is an amenable number.
10132100211401 is a deficient number, since it is larger than the sum of its proper divisors (2056892524279).
10132100211401 is an equidigital number, since it uses as much as digits as its factorization.
10132100211401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76181204623.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10132100211401 its reverse (10411200123101), we get a palindrome (20543300334502).
The spelling of 10132100211401 in words is "ten trillion, one hundred thirty-two billion, one hundred million, two hundred eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •