Base | Representation |
---|---|
bin | 1001000110010101000010… |
… | …0111010000110010000110 |
3 | 1022102101221001100012012210 |
4 | 2101211100213100302012 |
5 | 2302402332303131042 |
6 | 33135532031524250 |
7 | 2051534440661061 |
oct | 221452047206206 |
9 | 38371831305183 |
10 | 10004331302022 |
11 | 32078a4231372 |
12 | 1156aa6389686 |
13 | 5775345b7525 |
14 | 2682d84838d8 |
15 | 12538030ba9c |
hex | 919509d0c86 |
10004331302022 has 32 divisors (see below), whose sum is σ = 21067784104320. Its totient is φ = 3158357417280.
The previous prime is 10004331301999. The next prime is 10004331302029. The reversal of 10004331302022 is 22020313340001.
It is a self number, because there is not a number n which added to its sum of digits gives 10004331302022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10004331302029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12171103 + ... + 12967050.
It is an arithmetic number, because the mean of its divisors is an integer number (658368253260).
Almost surely, 210004331302022 is an apocalyptic number.
10004331302022 is an abundant number, since it is smaller than the sum of its proper divisors (11063452802298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10004331302022 is a wasteful number, since it uses less digits than its factorization.
10004331302022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25141668.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 10004331302022 its reverse (22020313340001), we get a palindrome (32024644642023).
The spelling of 10004331302022 in words is "ten trillion, four billion, three hundred thirty-one million, three hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •