Base | Representation |
---|---|
bin | 11101111110100010001… |
… | …10001011000110010010 |
3 | 10122110121211120120002000 |
4 | 32333101012023012102 |
5 | 113333422320141320 |
6 | 2105102230534430 |
7 | 134262330041322 |
oct | 16772106130622 |
9 | 3573554516060 |
10 | 1030005240210 |
11 | 367906118a81 |
12 | 147756807416 |
13 | 7618a776b4b |
14 | 37bd1457282 |
15 | 1bbd5a77c90 |
hex | efd118b192 |
1030005240210 has 64 divisors (see below), whose sum is σ = 2748763987200. Its totient is φ = 274459729536.
The previous prime is 1030005240193. The next prime is 1030005240211. The reversal of 1030005240210 is 120425000301.
1030005240210 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1030005240211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1089979 + ... + 1802238.
It is an arithmetic number, because the mean of its divisors is an integer number (42949437300).
Almost surely, 21030005240210 is an apocalyptic number.
1030005240210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030005240210 is an abundant number, since it is smaller than the sum of its proper divisors (1718758746990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030005240210 is a wasteful number, since it uses less digits than its factorization.
1030005240210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2893552 (or 2893546 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The spelling of 1030005240210 in words is "one trillion, thirty billion, five million, two hundred forty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •