Base | Representation |
---|---|
bin | 11110000010110110010… |
… | …00111111000011101010 |
3 | 10122200121020112012002120 |
4 | 33001123020333003222 |
5 | 113403143213430010 |
6 | 2110124122412110 |
7 | 134403611462265 |
oct | 17013310770352 |
9 | 3580536465076 |
10 | 1032321233130 |
11 | 368894472810 |
12 | 1480a2361036 |
13 | 7646952b565 |
14 | 37d70c89cdc |
15 | 1bcbe057e70 |
hex | f05b23f0ea |
1032321233130 has 64 divisors (see below), whose sum is σ = 2703492868608. Its totient is φ = 250195972160.
The previous prime is 1032321233117. The next prime is 1032321233143. The reversal of 1032321233130 is 313321232301.
It is an interprime number because it is at equal distance from previous prime (1032321233117) and next prime (1032321233143).
It is a self number, because there is not a number n which added to its sum of digits gives 1032321233130.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 906229 + ... + 1698791.
It is an arithmetic number, because the mean of its divisors is an integer number (42242076072).
Almost surely, 21032321233130 is an apocalyptic number.
1032321233130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1032321233130 is an abundant number, since it is smaller than the sum of its proper divisors (1671171635478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032321233130 is a wasteful number, since it uses less digits than its factorization.
1032321233130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796531.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 1032321233130 its reverse (313321232301), we get a palindrome (1345642465431).
The spelling of 1032321233130 in words is "one trillion, thirty-two billion, three hundred twenty-one million, two hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •