Base | Representation |
---|---|
bin | 10000011101010110110… |
… | …001001011001001000000 |
3 | 11000010101120111022110001 |
4 | 100131112301023021000 |
5 | 122012323211130422 |
6 | 2223331115445344 |
7 | 144500013324043 |
oct | 20352661131100 |
9 | 4003346438401 |
10 | 1131032130112 |
11 | 3a6739173715 |
12 | 163250456854 |
13 | 8286ac49c41 |
14 | 3ca56a24c5a |
15 | 1e64a006227 |
hex | 10756c4b240 |
1131032130112 has 84 divisors (see below), whose sum is σ = 2383274975376. Its totient is φ = 532463466240.
The previous prime is 1131032130103. The next prime is 1131032130157. The reversal of 1131032130112 is 2110312301311.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 1131032130112.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3615787 + ... + 3916117.
Almost surely, 21131032130112 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 1131032130112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1191637487688).
1131032130112 is an abundant number, since it is smaller than the sum of its proper divisors (1252242845264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131032130112 is a wasteful number, since it uses less digits than its factorization.
1131032130112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300544 (or 300515 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1131032130112 its reverse (2110312301311), we get a palindrome (3241344431423).
The spelling of 1131032130112 in words is "one trillion, one hundred thirty-one billion, thirty-two million, one hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •