Base | Representation |
---|---|
bin | 101111000101101011… |
… | …0101001111111100011 |
3 | 100200000101022000200112 |
4 | 1132023112221333203 |
5 | 3124044242020003 |
6 | 114242132041535 |
7 | 10206621454640 |
oct | 1361326517743 |
9 | 320011260615 |
10 | 101122220003 |
11 | 39981947652 |
12 | 177217632ab |
13 | 96c717014c |
14 | 4c74104dc7 |
15 | 296ca0e3d8 |
hex | 178b5a9fe3 |
101122220003 has 8 divisors (see below), whose sum is σ = 120592958208. Its totient is φ = 82907658504.
The previous prime is 101122219973. The next prime is 101122220021. The reversal of 101122220003 is 300022221101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101122220003 - 220 = 101121171427 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101122220003.
It is not an unprimeable number, because it can be changed into a prime (101122220203) by changing a digit.
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, 314044001 + ... + 314044322.
It is an arithmetic number, because the mean of its divisors is an integer number (15074119776).
Almost surely, 2101122220003 is an apocalyptic number.
101122220003 is a deficient number, since it is larger than the sum of its proper divisors (19470738205).
101122220003 is an equidigital number, since it uses as much as digits as its factorization.
101122220003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628088353.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 101122220003 its reverse (300022221101), we get a palindrome (401144441104).
The spelling of 101122220003 in words is "one hundred one billion, one hundred twenty-two million, two hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •