Base | Representation |
---|---|
bin | 11100000100100111… |
… | …000001110100111000 |
3 | 2212210122200220001200 |
4 | 130010213001310320 |
5 | 443212340023112 |
6 | 21502550014200 |
7 | 2114643500505 |
oct | 340447016470 |
9 | 85718626050 |
10 | 30142111032 |
11 | 11868488170 |
12 | 5a12647360 |
13 | 2ac4961277 |
14 | 165d27c4ac |
15 | bb634acdc |
hex | 7049c1d38 |
30142111032 has 96 divisors (see below), whose sum is σ = 89139988080. Its totient is φ = 9125383680.
The previous prime is 30142110997. The next prime is 30142111049. The reversal of 30142111032 is 23011124103.
It is a super-2 number, since 2×301421110322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 30142110996 and 30142111014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 851478 + ... + 886170.
Almost surely, 230142111032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30142111032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44569994040).
30142111032 is an abundant number, since it is smaller than the sum of its proper divisors (58997877048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30142111032 is a wasteful number, since it uses less digits than its factorization.
30142111032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35813 (or 35806 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30142111032 its reverse (23011124103), we get a palindrome (53153235135).
The spelling of 30142111032 in words is "thirty billion, one hundred forty-two million, one hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •