Base | Representation |
---|---|
bin | 10110110010100010100101… |
… | …010011101001010110101100 |
3 | 111010212220111002220110222222 |
4 | 112302202211103221112230 |
5 | 101114132301313211340 |
6 | 553101030335454512 |
7 | 30053250030512603 |
oct | 2662424523512654 |
9 | 433786432813888 |
10 | 100230130210220 |
11 | 29a333a556725a |
12 | b2a932b987438 |
13 | 43c08787ba57a |
14 | 1aa7242754a3a |
15 | b8c337edd8b5 |
hex | 5b28a54e95ac |
100230130210220 has 24 divisors (see below), whose sum is σ = 210486888033408. Its totient is φ = 40091363590400.
The previous prime is 100230130210219. The next prime is 100230130210253. The reversal of 100230130210220 is 22012031032001.
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 7 ways as a sum of consecutive naturals, for example, 41836301 + ... + 44167140.
It is an arithmetic number, because the mean of its divisors is an integer number (8770287001392).
Almost surely, 2100230130210220 is an apocalyptic number.
100230130210220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100230130210220 is an abundant number, since it is smaller than the sum of its proper divisors (110256757823188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100230130210220 is a wasteful number, since it uses less digits than its factorization.
100230130210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86061721 (or 86061719 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 100230130210220 its reverse (22012031032001), we get a palindrome (122242161242221).
The spelling of 100230130210220 in words is "one hundred trillion, two hundred thirty billion, one hundred thirty million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •