Base | Representation |
---|---|
bin | 10110110011101100111110… |
… | …100001101111100011101110 |
3 | 111011011112200002020222110221 |
4 | 112303230332201233203232 |
5 | 101121434400104343042 |
6 | 553201441005521554 |
7 | 30062105364500614 |
oct | 2663547641574356 |
9 | 434145602228427 |
10 | 100310010231022 |
11 | 29a64266776179 |
12 | b3009035732ba |
13 | 43c8268b04a77 |
14 | 1aab05d5bb6b4 |
15 | b8e460bacd67 |
hex | 5b3b3e86f8ee |
100310010231022 has 8 divisors (see below), whose sum is σ = 150481297704672. Its totient is φ = 50149577662800.
The previous prime is 100310010230959. The next prime is 100310010231083. The reversal of 100310010231022 is 220132010013001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1003100102310222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100310010230987 and 100310010231005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2713703254 + ... + 2713740217.
It is an arithmetic number, because the mean of its divisors is an integer number (18810162213084).
Almost surely, 2100310010231022 is an apocalyptic number.
100310010231022 is a deficient number, since it is larger than the sum of its proper divisors (50171287473650).
100310010231022 is an equidigital number, since it uses as much as digits as its factorization.
100310010231022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5427452714.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100310010231022 its reverse (220132010013001), we get a palindrome (320442020244023).
The spelling of 100310010231022 in words is "one hundred trillion, three hundred ten billion, ten million, two hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •