Base | Representation |
---|---|
bin | 10111001100011110010001… |
… | …000000001110000000101001 |
3 | 111101012021022200111110010202 |
4 | 113030132101000032000221 |
5 | 101332331441424013001 |
6 | 1000543431433321545 |
7 | 30326065303350644 |
oct | 2714362100160051 |
9 | 441167280443122 |
10 | 102012201001001 |
11 | 2a56014a015665 |
12 | b5367938662b5 |
13 | 44bc92b389925 |
14 | 1b295b9c82a5b |
15 | bbd8889c396b |
hex | 5cc79100e029 |
102012201001001 has 6 divisors (see below), whose sum is σ = 107663846486202. Its totient is φ = 96643137790080.
The previous prime is 102012201000973. The next prime is 102012201001049. The reversal of 102012201001001 is 100100102210201.
It can be written as a sum of positive squares in only one way, i.e., 67333528901401 + 34678672099600 = 8205701^2 + 5888860^2 .
It is a de Polignac number, because none of the positive numbers 2k-102012201001001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102012201001801) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 141291136760 + ... + 141291137481.
It is an arithmetic number, because the mean of its divisors is an integer number (17943974414367).
Almost surely, 2102012201001001 is an apocalyptic number.
It is an amenable number.
102012201001001 is a deficient number, since it is larger than the sum of its proper divisors (5651645485201).
102012201001001 is an equidigital number, since it uses as much as digits as its factorization.
102012201001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282582274279 (or 282582274260 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102012201001001 its reverse (100100102210201), we get a palindrome (202112303211202).
The spelling of 102012201001001 in words is "one hundred two trillion, twelve billion, two hundred one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •