Base | Representation |
---|---|
bin | 101111000010111111… |
… | …1010000011110111010 |
3 | 100122210002220112121212 |
4 | 1132011333100132322 |
5 | 3123403220400442 |
6 | 114225154403122 |
7 | 10204446350210 |
oct | 1360577203672 |
9 | 318702815555 |
10 | 101032200122 |
11 | 39936052357 |
12 | 176b75904a2 |
13 | 96b1612149 |
14 | 4c66190cb0 |
15 | 2964b7ba82 |
hex | 1785fd07ba |
101032200122 has 8 divisors (see below), whose sum is σ = 173198057376. Its totient is φ = 43299514332.
The previous prime is 101032200077. The next prime is 101032200221. The reversal of 101032200122 is 221002230101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1010322001222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 7216585723 = 101032200122 / (1 + 0 + 1 + 0 + 3 + 2 + 2 + 0 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 101032200097 and 101032200106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3608292848 + ... + 3608292875.
It is an arithmetic number, because the mean of its divisors is an integer number (21649757172).
Almost surely, 2101032200122 is an apocalyptic number.
101032200122 is a deficient number, since it is larger than the sum of its proper divisors (72165857254).
101032200122 is an equidigital number, since it uses as much as digits as its factorization.
101032200122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7216585732.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 101032200122 its reverse (221002230101), we get a palindrome (322034430223).
The spelling of 101032200122 in words is "one hundred one billion, thirty-two million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •