Base | Representation |
---|---|
bin | 1001010001110101011101… |
… | …0100000111111001001001 |
3 | 1100010022011202212100121112 |
4 | 2110131113110013321021 |
5 | 2314122210112033001 |
6 | 33410423440020105 |
7 | 2102033242032656 |
oct | 224352724077111 |
9 | 40108152770545 |
10 | 10202012221001 |
11 | 3283715a29687 |
12 | 1189275301635 |
13 | 5900793104c3 |
14 | 273acc56ac2d |
15 | 12a59ed90cbb |
hex | 94757507e49 |
10202012221001 has 8 divisors (see below), whose sum is σ = 10211893802880. Its totient is φ = 10192131273168.
The previous prime is 10202012220977. The next prime is 10202012221061. The reversal of 10202012221001 is 10012221020201.
10202012221001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10202012221001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10202012221061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36020000 + ... + 36302126.
It is an arithmetic number, because the mean of its divisors is an integer number (1276486725360).
Almost surely, 210202012221001 is an apocalyptic number.
It is an amenable number.
10202012221001 is a deficient number, since it is larger than the sum of its proper divisors (9881581879).
10202012221001 is a wasteful number, since it uses less digits than its factorization.
10202012221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317023.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10202012221001 its reverse (10012221020201), we get a palindrome (20214233241202).
The spelling of 10202012221001 in words is "ten trillion, two hundred two billion, twelve million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •