Base | Representation |
---|---|
bin | 10111001100010100111100… |
… | …111101101101000011111101 |
3 | 111101011022111202221220122120 |
4 | 113030110330331231003331 |
5 | 101332201001441333041 |
6 | 1000535055253233153 |
7 | 30325262426645625 |
oct | 2714247475550375 |
9 | 441138452856576 |
10 | 102002201121021 |
11 | 2a556988382843 |
12 | b5348629327b9 |
13 | 44bb9c6711c96 |
14 | 1b28d0bb51885 |
15 | bbd4a0b3b366 |
hex | 5cc53cf6d0fd |
102002201121021 has 4 divisors (see below), whose sum is σ = 136002934828032. Its totient is φ = 68001467414012.
The previous prime is 102002201120987. The next prime is 102002201121101. The reversal of 102002201121021 is 120121102200201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102002201121021 - 223 = 102002192732413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002201125021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17000366853501 + ... + 17000366853506.
It is an arithmetic number, because the mean of its divisors is an integer number (34000733707008).
Almost surely, 2102002201121021 is an apocalyptic number.
It is an amenable number.
102002201121021 is a deficient number, since it is larger than the sum of its proper divisors (34000733707011).
102002201121021 is an equidigital number, since it uses as much as digits as its factorization.
102002201121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34000733707010.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102002201121021 its reverse (120121102200201), we get a palindrome (222123303321222).
The spelling of 102002201121021 in words is "one hundred two trillion, two billion, two hundred one million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •