Base | Representation |
---|---|
bin | 10010110100010001… |
… | …00100110100100001 |
3 | 222002000221110220002 |
4 | 21122020210310201 |
5 | 131142121211001 |
6 | 4350231425345 |
7 | 505224463613 |
oct | 113210446441 |
9 | 28060843802 |
10 | 10102132001 |
11 | 4314432325 |
12 | 1b5b225255 |
13 | c4cbc9500 |
14 | 6bb94adb3 |
15 | 3e1d3446b |
hex | 25a224d21 |
10102132001 has 6 divisors (see below), whose sum is σ = 10938995190. Its totient is φ = 9325044768.
The previous prime is 10102131997. The next prime is 10102132039. The reversal of 10102132001 is 10023120101.
It can be written as a sum of positive squares in 3 ways, for example, as 385101376 + 9717030625 = 19624^2 + 98575^2 .
It is not a de Polignac number, because 10102132001 - 22 = 10102131997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10102132081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 29887796 + ... + 29888133.
It is an arithmetic number, because the mean of its divisors is an integer number (1823165865).
Almost surely, 210102132001 is an apocalyptic number.
It is an amenable number.
10102132001 is a deficient number, since it is larger than the sum of its proper divisors (836863189).
10102132001 is an equidigital number, since it uses as much as digits as its factorization.
10102132001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59775955 (or 59775942 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10102132001 its reverse (10023120101), we get a palindrome (20125252102).
The spelling of 10102132001 in words is "ten billion, one hundred two million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •