Base | Representation |
---|---|
bin | 10111001100011110000101… |
… | …101011110011111100110001 |
3 | 111101012020211110011120200110 |
4 | 113030132011223303330301 |
5 | 101332331044320231001 |
6 | 1000543400531211533 |
7 | 30326060506263360 |
oct | 2714360553637461 |
9 | 441166743146613 |
10 | 102012011102001 |
11 | 2a560061901740 |
12 | b536740146ba9 |
13 | 44bc8cac2b160 |
14 | 1b2959c96d7d7 |
15 | bbd876eb23d6 |
hex | 5cc785af3f31 |
102012011102001 has 128 divisors (see below), whose sum is σ = 185020457287680. Its totient is φ = 48277741824000.
The previous prime is 102012011101969. The next prime is 102012011102039. The reversal of 102012011102001 is 100201110210201.
It is not a de Polignac number, because 102012011102001 - 25 = 102012011101969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102012011502001) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 94396560 + ... + 95471118.
It is an arithmetic number, because the mean of its divisors is an integer number (1445472322560).
Almost surely, 2102012011102001 is an apocalyptic number.
102012011102001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102012011102001 is a deficient number, since it is larger than the sum of its proper divisors (83008446185679).
102012011102001 is a wasteful number, since it uses less digits than its factorization.
102012011102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075007.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102012011102001 its reverse (100201110210201), we get a palindrome (202213121312202).
It can be divided in two parts, 1020120 and 11102001, that added together give a palindrome (12122121).
The spelling of 102012011102001 in words is "one hundred two trillion, twelve billion, eleven million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •