Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0001000011010101011 |
3 | 100122222200021221110111 |
4 | 1132022300020122223 |
5 | 3124034200333003 |
6 | 114241131355151 |
7 | 10206436563535 |
oct | 1361260103253 |
9 | 318880257414 |
10 | 101112121003 |
11 | 3997717a073 |
12 | 1771a2b2ab7 |
13 | 96c50454ca |
14 | 4c72a36855 |
15 | 296bbb6e6d |
hex | 178ac086ab |
101112121003 has 8 divisors (see below), whose sum is σ = 102242549808. Its totient is φ = 99985826304.
The previous prime is 101112120997. The next prime is 101112121007. The reversal of 101112121003 is 300121211101.
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 101112121003 - 29 = 101112120491 is a prime.
It is a super-2 number, since 2×1011121210032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101112121007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 984325 + ... + 1082182.
It is an arithmetic number, because the mean of its divisors is an integer number (12780318726).
Almost surely, 2101112121003 is an apocalyptic number.
101112121003 is a deficient number, since it is larger than the sum of its proper divisors (1130428805).
101112121003 is a wasteful number, since it uses less digits than its factorization.
101112121003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2067053.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101112121003 its reverse (300121211101), we get a palindrome (401233332104).
The spelling of 101112121003 in words is "one hundred one billion, one hundred twelve million, one hundred twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •