Base | Representation |
---|---|
bin | 10111001111001110001101… |
… | …100101000110100100100101 |
3 | 111101212022221220220202210001 |
4 | 113033032031211012210211 |
5 | 101343430344230401041 |
6 | 1001210314120501301 |
7 | 30345534036365146 |
oct | 2717161545064445 |
9 | 441768856822701 |
10 | 102201122122021 |
11 | 2a62328607302a |
12 | b56731901a831 |
13 | 45046a83243c0 |
14 | 1b347bc7ddacd |
15 | bc37444c7131 |
hex | 5cf38d946925 |
102201122122021 has 16 divisors (see below), whose sum is σ = 112427933184000. Its totient is φ = 92313031448448.
The previous prime is 102201122121997. The next prime is 102201122122031. The reversal of 102201122122021 is 120221221102201.
It is a cyclic number.
It is not a de Polignac number, because 102201122122021 - 227 = 102200987904293 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102201122122021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102201122122031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14495256 + ... + 20359633.
It is an arithmetic number, because the mean of its divisors is an integer number (7026745824000).
Almost surely, 2102201122122021 is an apocalyptic number.
It is an amenable number.
102201122122021 is a deficient number, since it is larger than the sum of its proper divisors (10226811061979).
102201122122021 is a wasteful number, since it uses less digits than its factorization.
102201122122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34859748.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102201122122021 its reverse (120221221102201), we get a palindrome (222422343224222).
The spelling of 102201122122021 in words is "one hundred two trillion, two hundred one billion, one hundred twenty-two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •