Base | Representation |
---|---|
bin | 11101101111110011110… |
… | …11001110000011100001 |
3 | 10121201012221000222200201 |
4 | 32313321323032003201 |
5 | 113221230134100001 |
6 | 2101314004345201 |
7 | 133562412126364 |
oct | 16677173160341 |
9 | 3551187028621 |
10 | 1022100300001 |
11 | 364519a78440 |
12 | 14610b3a5201 |
13 | 754cab37a31 |
14 | 376816560db |
15 | 1b8c1aa8501 |
hex | edf9ece0e1 |
1022100300001 has 8 divisors (see below), whose sum is σ = 1115197072704. Its totient is φ = 929033287920.
The previous prime is 1022100299981. The next prime is 1022100300043. The reversal of 1022100300001 is 1000030012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1022100300001 - 227 = 1021966082273 is a prime.
It is a super-3 number, since 3×10221003000013 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1022100300301) 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, 7368310 + ... + 7505743.
It is an arithmetic number, because the mean of its divisors is an integer number (139399634088).
Almost surely, 21022100300001 is an apocalyptic number.
1022100300001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1022100300001 is a deficient number, since it is larger than the sum of its proper divisors (93096772703).
1022100300001 is a wasteful number, since it uses less digits than its factorization.
1022100300001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14880311.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 1022100300001 its reverse (1000030012201), we get a palindrome (2022130312202).
The spelling of 1022100300001 in words is "one trillion, twenty-two billion, one hundred million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •