Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …110110100111110110111010 |
3 | 111010111120102001001222222012 |
4 | 112300331320312213312322 |
5 | 101110344334104101020 |
6 | 552535225545125522 |
7 | 30042401515002230 |
oct | 2660757066476672 |
9 | 433446361058865 |
10 | 100122010222010 |
11 | 299a156265a8a7 |
12 | b2903967898a2 |
13 | 43b360794629a |
14 | 1aa1d07114950 |
15 | b8960aea67c5 |
hex | 5b0f78da7dba |
100122010222010 has 32 divisors (see below), whose sum is σ = 207964941080832. Its totient is φ = 33994269210240.
The previous prime is 100122010221971. The next prime is 100122010222043. The reversal of 100122010222010 is 10222010221001.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon 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 15 ways as a sum of consecutive naturals, for example, 6943266731 + ... + 6943281150.
It is an arithmetic number, because the mean of its divisors is an integer number (6498904408776).
Almost surely, 2100122010222010 is an apocalyptic number.
100122010222010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100122010222010 is an abundant number, since it is smaller than the sum of its proper divisors (107842930858822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100122010222010 is a wasteful number, since it uses less digits than its factorization.
100122010222010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13886547998.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100122010222010 its reverse (10222010221001), we get a palindrome (110344020443011).
The spelling of 100122010222010 in words is "one hundred trillion, one hundred twenty-two billion, ten million, two hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •