Base | Representation |
---|---|
bin | 10111011011010010010000… |
… | …101000011010100100000000 |
3 | 111111210120200221211100200020 |
4 | 113123102100220122210000 |
5 | 102001021122103310422 |
6 | 1003043213032453440 |
7 | 30462451655231634 |
oct | 2733222050324400 |
9 | 444716627740606 |
10 | 103030102010112 |
11 | 2a912903660662 |
12 | b67bb1084a280 |
13 | 456490a206644 |
14 | 1b6297d908dc4 |
15 | bda0b1a8c95c |
hex | 5db490a1a900 |
103030102010112 has 36 divisors (see below), whose sum is σ = 274210323581040. Its totient is φ = 34343367336448.
The previous prime is 103030102010111. The next prime is 103030102010183. The reversal of 103030102010112 is 211010201030301.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 103030102010091 and 103030102010100.
It is not an unprimeable number, because it can be changed into a prime (103030102010111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67076888562 + ... + 67076890097.
Almost surely, 2103030102010112 is an apocalyptic number.
103030102010112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103030102010112 is an abundant number, since it is smaller than the sum of its proper divisors (171180221570928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103030102010112 is an equidigital number, since it uses as much as digits as its factorization.
103030102010112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134153778678 (or 134153778664 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103030102010112 its reverse (211010201030301), we get a palindrome (314040303040413).
The spelling of 103030102010112 in words is "one hundred three trillion, thirty billion, one hundred two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •