Base | Representation |
---|---|
bin | 11101000110110111100… |
… | …11000010000111111110 |
3 | 10112121111002020002221100 |
4 | 32203123303002013332 |
5 | 112341221210013042 |
6 | 2043240534313530 |
7 | 132153622513152 |
oct | 16433363020776 |
9 | 3477432202840 |
10 | 1000120001022 |
11 | 35616a73849a |
12 | 1419b61b88a6 |
13 | 734070c306c |
14 | 36598363062 |
15 | 1b03706c24c |
hex | e8dbcc21fe |
1000120001022 has 48 divisors (see below), whose sum is σ = 2203910195760. Its totient is φ = 327684873600.
The previous prime is 1000120001017. The next prime is 1000120001057. The reversal of 1000120001022 is 2201000210001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1000120000995 and 1000120001013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9955122 + ... + 10055082.
It is an arithmetic number, because the mean of its divisors is an integer number (45914795745).
Almost surely, 21000120001022 is an apocalyptic number.
1000120001022 is an abundant number, since it is smaller than the sum of its proper divisors (1203790194738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000120001022 is a wasteful number, since it uses less digits than its factorization.
1000120001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109449 (or 109446 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1000120001022 its reverse (2201000210001), we get a palindrome (3201120211023).
The spelling of 1000120001022 in words is "one trillion, one hundred twenty million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •