Base | Representation |
---|---|
bin | 11101111110110001000… |
… | …10111001100100100110 |
3 | 10122110221112201201220212 |
4 | 32333120202321210212 |
5 | 113334201313223420 |
6 | 2105122453255422 |
7 | 134265405215060 |
oct | 16773042714446 |
9 | 3573845651825 |
10 | 1030130211110 |
11 | 36796a715510 |
12 | 147790634572 |
13 | 761aa621520 |
14 | 37c03ca8730 |
15 | 1bbe1a113c5 |
hex | efd88b9926 |
1030130211110 has 256 divisors, whose sum is σ = 2612088815616. Its totient is φ = 282113280000.
The previous prime is 1030130211083. The next prime is 1030130211113. The reversal of 1030130211110 is 111120310301.
It is a happy number.
It is a super-2 number, since 2×10301302111102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030130211113) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 18901700 + ... + 18956120.
It is an arithmetic number, because the mean of its divisors is an integer number (10203471936).
Almost surely, 21030130211110 is an apocalyptic number.
1030130211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030130211110 is an abundant number, since it is smaller than the sum of its proper divisors (1581958604506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030130211110 is a wasteful number, since it uses less digits than its factorization.
1030130211110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54551.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1030130211110 its reverse (111120310301), we get a palindrome (1141250521411).
The spelling of 1030130211110 in words is "one trillion, thirty billion, one hundred thirty million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •