Base | Representation |
---|---|
bin | 11101101111110011111… |
… | …01111110010100110001 |
3 | 10121201012222101200002110 |
4 | 32313321331332110301 |
5 | 113221230330201001 |
6 | 2101314032035533 |
7 | 133562421224343 |
oct | 16677175762461 |
9 | 3551188350073 |
10 | 1022101022001 |
11 | 36451a420934 |
12 | 14610b692ba9 |
13 | 754cb02b557 |
14 | 376817a3293 |
15 | 1b8c1b9c3d6 |
hex | edf9f7e531 |
1022101022001 has 8 divisors (see below), whose sum is σ = 1362806132224. Its totient is φ = 681398296560.
The previous prime is 1022101021973. The next prime is 1022101022021. The reversal of 1022101022001 is 1002201012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022101022001 - 29 = 1022101021489 is a prime.
It is a super-3 number, since 3×10221010220013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022101022021) 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, 1065456 + ... + 1783086.
It is an arithmetic number, because the mean of its divisors is an integer number (170350766528).
Almost surely, 21022101022001 is an apocalyptic number.
It is an amenable number.
1022101022001 is a deficient number, since it is larger than the sum of its proper divisors (340705110223).
1022101022001 is an equidigital number, since it uses as much as digits as its factorization.
1022101022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1192391.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1022101022001 its reverse (1002201012201), we get a palindrome (2024302034202).
It can be divided in two parts, 102210 and 1022001, that added together give a palindrome (1124211).
The spelling of 1022101022001 in words is "one trillion, twenty-two billion, one hundred one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •