Base | Representation |
---|---|
bin | 11110000010011101011… |
… | …10101000111001000000 |
3 | 10122200001201200211221102 |
4 | 33001032232220321000 |
5 | 113402231412000000 |
6 | 2110051323313532 |
7 | 134365502514515 |
oct | 17011656507100 |
9 | 3580051624842 |
10 | 1032113000000 |
11 | 368797977115 |
12 | 14804467b8a8 |
13 | 764353509a4 |
14 | 37d5136330c |
15 | 1bcaab243d5 |
hex | f04eba8e40 |
1032113000000 has 196 divisors, whose sum is σ = 2569901401716. Its totient is φ = 411264000000.
The previous prime is 1032112999937. The next prime is 1032113000041. The reversal of 1032113000000 is 3112301.
It can be written as a sum of positive squares in 14 ways, for example, as 703169456704 + 328943543296 = 838552^2 + 573536^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 280998164 + ... + 281001836.
Almost surely, 21032113000000 is an apocalyptic number.
1032113000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1032113000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1284950700858).
1032113000000 is an abundant number, since it is smaller than the sum of its proper divisors (1537788401716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032113000000 is an frugal number, since it uses more digits than its factorization.
1032113000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3996 (or 3961 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 1032113000000 its reverse (3112301), we get a palindrome (1032116112301).
The spelling of 1032113000000 in words is "one trillion, thirty-two billion, one hundred thirteen million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •