Base | Representation |
---|---|
bin | 10111001100100111100001… |
… | …011111001001010101101001 |
3 | 111101020012222102202220102102 |
4 | 113030213201133021111221 |
5 | 101333012321123021301 |
6 | 1000552154042543145 |
7 | 30326566524000566 |
oct | 2714474137112551 |
9 | 441205872686372 |
10 | 102022141220201 |
11 | 2a564390009454 |
12 | b5386a8807ab5 |
13 | 44c0853875b37 |
14 | 1b29c800c386d |
15 | bbdc6b4c3b6b |
hex | 5cc9e17c9569 |
102022141220201 has 4 divisors (see below), whose sum is σ = 103032261430404. Its totient is φ = 101012021010000.
The previous prime is 102022141220177. The next prime is 102022141220231.
It is a happy number.
102022141220201 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58583180221225 + 43438960998976 = 7653965^2 + 6590824^2 .
It is a cyclic number.
It is not a de Polignac number, because 102022141220201 - 226 = 102022074111337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102022141220231) 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, 505060104950 + ... + 505060105151.
It is an arithmetic number, because the mean of its divisors is an integer number (25758065357601).
Almost surely, 2102022141220201 is an apocalyptic number.
It is an amenable number.
102022141220201 is a deficient number, since it is larger than the sum of its proper divisors (1010120210203).
102022141220201 is a wasteful number, since it uses less digits than its factorization.
102022141220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010120210202.
The product of its (nonzero) digits is 256, while the sum is 20.
The spelling of 102022141220201 in words is "one hundred two trillion, twenty-two billion, one hundred forty-one million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •