Base | Representation |
---|---|
bin | 11110000010011101011… |
… | …11001000111011011000 |
3 | 10122200001201221111221120 |
4 | 33001032233020323120 |
5 | 113402231430144344 |
6 | 2110051330205240 |
7 | 134365503602220 |
oct | 17011657107330 |
9 | 3580051844846 |
10 | 1032113131224 |
11 | 368797a5676a |
12 | 148044723820 |
13 | 76435398636 |
14 | 37d51399080 |
15 | 1bcaab4d219 |
hex | f04ebc8ed8 |
1032113131224 has 64 divisors (see below), whose sum is σ = 2949204038400. Its totient is φ = 294858528384.
The previous prime is 1032113131213. The next prime is 1032113131319. The reversal of 1032113131224 is 4221313112301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 1032113131194 and 1032113131203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1308307 + ... + 1943165.
It is an arithmetic number, because the mean of its divisors is an integer number (46081313100).
Almost surely, 21032113131224 is an apocalyptic number.
1032113131224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1032113131224 is an abundant number, since it is smaller than the sum of its proper divisors (1917090907176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032113131224 is a wasteful number, since it uses less digits than its factorization.
1032113131224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644552 (or 644548 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 1032113131224 its reverse (4221313112301), we get a palindrome (5253426243525).
The spelling of 1032113131224 in words is "one trillion, thirty-two billion, one hundred thirteen million, one hundred thirty-one thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •