Base | Representation |
---|---|
bin | 11110000010010011100… |
… | …10110010110011111010 |
3 | 10122122211221220022222200 |
4 | 33001021302302303322 |
5 | 113402044213000010 |
6 | 2110035204531030 |
7 | 134363445662313 |
oct | 17011162626372 |
9 | 3578757808880 |
10 | 1032030203130 |
11 | 368755165653 |
12 | 1480209b0a76 |
13 | 76421151564 |
14 | 37d4436d60a |
15 | 1bca371bcc0 |
hex | f049cb2cfa |
1032030203130 has 48 divisors (see below), whose sum is σ = 2709329800320. Its totient is φ = 272536128864.
The previous prime is 1032030203117. The next prime is 1032030203137. The reversal of 1032030203130 is 313020302301.
1032030203130 is a `hidden beast` number, since 1 + 0 + 320 + 30 + 2 + 0 + 313 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1032030203137) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55655790 + ... + 55674329.
It is an arithmetic number, because the mean of its divisors is an integer number (56444370840).
Almost surely, 21032030203130 is an apocalyptic number.
1032030203130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1032030203130 is an abundant number, since it is smaller than the sum of its proper divisors (1677299597190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032030203130 is a wasteful number, since it uses less digits than its factorization.
1032030203130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111330235 (or 111330232 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 1032030203130 its reverse (313020302301), we get a palindrome (1345050505431).
The spelling of 1032030203130 in words is "one trillion, thirty-two billion, thirty million, two hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •