Base | Representation |
---|---|
bin | 11101111110101110110… |
… | …10110011000011010000 |
3 | 10122110220020011110111221 |
4 | 32333113122303003100 |
5 | 113334131443410112 |
6 | 2105120540214424 |
7 | 134265055443640 |
oct | 16772732630320 |
9 | 3573806143457 |
10 | 1030111310032 |
11 | 36795aa85892 |
12 | 14778623a414 |
13 | 761a673435c |
14 | 37c01588520 |
15 | 1bbe002ae07 |
hex | efd76b30d0 |
1030111310032 has 20 divisors (see below), whose sum is σ = 2280960758176. Its totient is φ = 441476275680.
The previous prime is 1030111310021. The next prime is 1030111310047. The reversal of 1030111310032 is 2300131110301.
It is a super-2 number, since 2×10301113100322 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 1030111309988 and 1030111310015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4598711094 + ... + 4598711317.
Almost surely, 21030111310032 is an apocalyptic number.
It is an amenable number.
1030111310032 is an abundant number, since it is smaller than the sum of its proper divisors (1250849448144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030111310032 is an equidigital number, since it uses as much as digits as its factorization.
1030111310032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9197422426 (or 9197422420 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1030111310032 its reverse (2300131110301), we get a palindrome (3330242420333).
The spelling of 1030111310032 in words is "one trillion, thirty billion, one hundred eleven million, three hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •