Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …100010110011001000110010 |
3 | 111020122122221100001221020120 |
4 | 112331322313202303020302 |
5 | 101214440310234021320 |
6 | 554500154415351110 |
7 | 30163612335104253 |
oct | 2675726742631062 |
9 | 436578840057216 |
10 | 101012120220210 |
11 | 2a204aaa535991 |
12 | b3b49aa822496 |
13 | 444952c449504 |
14 | 1ad3026c0cb2a |
15 | ba2855102440 |
hex | 5bdeb78b3232 |
101012120220210 has 16 divisors (see below), whose sum is σ = 242429088528576. Its totient is φ = 26936565392048.
The previous prime is 101012120220191. The next prime is 101012120220269. The reversal of 101012120220210 is 12022021210101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101012120220210.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1683535336974 + ... + 1683535337033.
It is an arithmetic number, because the mean of its divisors is an integer number (15151818033036).
Almost surely, 2101012120220210 is an apocalyptic number.
101012120220210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101012120220210 is an abundant number, since it is smaller than the sum of its proper divisors (141416968308366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012120220210 is a wasteful number, since it uses less digits than its factorization.
101012120220210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3367070674017.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101012120220210 its reverse (12022021210101), we get a palindrome (113034141430311).
The spelling of 101012120220210 in words is "one hundred one trillion, twelve billion, one hundred twenty million, two hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •