Base | Representation |
---|---|
bin | 11101111110111001011… |
… | …10010110010010111010 |
3 | 10122111010102122200220020 |
4 | 32333130232112102322 |
5 | 113334322240234320 |
6 | 2105133440111310 |
7 | 134300216150514 |
oct | 16773456262272 |
9 | 3574112580806 |
10 | 1030200321210 |
11 | 3679a6251245 |
12 | 1477b0005536 |
13 | 761bbccb1a8 |
14 | 37c0d318bb4 |
15 | 1bbe7c5e940 |
hex | efdcb964ba |
1030200321210 has 32 divisors (see below), whose sum is σ = 2472509152512. Its totient is φ = 274716932160.
The previous prime is 1030200321197. The next prime is 1030200321221. The reversal of 1030200321210 is 121230020301.
It is a super-2 number, since 2×10302003212102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1030200321210.
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, 3766900 + ... + 4031120.
It is an arithmetic number, because the mean of its divisors is an integer number (77265911016).
Almost surely, 21030200321210 is an apocalyptic number.
1030200321210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030200321210 is an abundant number, since it is smaller than the sum of its proper divisors (1442308831302).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030200321210 is a wasteful number, since it uses less digits than its factorization.
1030200321210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394198.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1030200321210 its reverse (121230020301), we get a palindrome (1151430341511).
The spelling of 1030200321210 in words is "one trillion, thirty billion, two hundred million, three hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •