Base | Representation |
---|---|
bin | 11101111110101111111… |
… | …00000100001110001000 |
3 | 10122110220211120112120220 |
4 | 32333113330010032020 |
5 | 113334141211443422 |
6 | 2105121451150040 |
7 | 134265222535554 |
oct | 16772774041610 |
9 | 3573824515526 |
10 | 1030120031112 |
11 | 3679649a2097 |
12 | 147789145320 |
13 | 761a8498a63 |
14 | 37c027b8864 |
15 | 1bbe0b9ee5c |
hex | efd7f04388 |
1030120031112 has 64 divisors (see below), whose sum is σ = 2581642013760. Its totient is φ = 342528076800.
The previous prime is 1030120031027. The next prime is 1030120031173. The reversal of 1030120031112 is 2111300210301.
It is a happy number.
It is a super-2 number, since 2×10301200311122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030120031091 and 1030120031100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92290812 + ... + 92301972.
It is an arithmetic number, because the mean of its divisors is an integer number (40338156465).
Almost surely, 21030120031112 is an apocalyptic number.
1030120031112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1030120031112 is an abundant number, since it is smaller than the sum of its proper divisors (1551521982648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030120031112 is a wasteful number, since it uses less digits than its factorization.
1030120031112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20294 (or 20290 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1030120031112 its reverse (2111300210301), we get a palindrome (3141420241413).
The spelling of 1030120031112 in words is "one trillion, thirty billion, one hundred twenty million, thirty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •