Base | Representation |
---|---|
bin | 10110101111011111110101… |
… | …111101101100010001110110 |
3 | 111010010220202112222211101212 |
4 | 112233133311331230101312 |
5 | 101102221032140341042 |
6 | 552421005444521422 |
7 | 30032165236245530 |
oct | 2657376575542166 |
9 | 433126675884355 |
10 | 100021030012022 |
11 | 299627539984a9 |
12 | b2748b46b0272 |
13 | 43a6c34038342 |
14 | 1a9b087c18850 |
15 | b86b9ab99482 |
hex | 5af7f5f6c476 |
100021030012022 has 64 divisors (see below), whose sum is σ = 177959721669120. Its totient is φ = 41269121381376.
The previous prime is 100021030011983. The next prime is 100021030012027. The reversal of 100021030012022 is 220210030120001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 100021030011988 and 100021030012006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100021030012027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16557254 + ... + 21775782.
It is an arithmetic number, because the mean of its divisors is an integer number (2780620651080).
Almost surely, 2100021030012022 is an apocalyptic number.
100021030012022 is a deficient number, since it is larger than the sum of its proper divisors (77938691657098).
100021030012022 is a wasteful number, since it uses less digits than its factorization.
100021030012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5218965.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100021030012022 its reverse (220210030120001), we get a palindrome (320231060132023).
The spelling of 100021030012022 in words is "one hundred trillion, twenty-one billion, thirty million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •