Base | Representation |
---|---|
bin | 1001010001111001111011… |
… | …0001001101111100011110 |
3 | 1100010102021022122011211000 |
4 | 2110132132301031330132 |
5 | 2314132134010432202 |
6 | 33411142422411130 |
7 | 2102105036531553 |
oct | 224363661157436 |
9 | 40112238564730 |
10 | 10203211030302 |
11 | 32841806a1874 |
12 | 118954a890aa6 |
13 | 59020a7a8a14 |
14 | 273ba386aa2a |
15 | 12a62024391c |
hex | 9479ec4df1e |
10203211030302 has 32 divisors (see below), whose sum is σ = 23867160307200. Its totient is φ = 3222066640824.
The previous prime is 10203211030253. The next prime is 10203211030367. The reversal of 10203211030302 is 20303011230201.
10203211030302 is a `hidden beast` number, since 1 + 0 + 2 + 0 + 321 + 10 + 30 + 302 = 666.
It is a super-2 number, since 2×102032110303022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 4972324038 + ... + 4972326089.
It is an arithmetic number, because the mean of its divisors is an integer number (745848759600).
Almost surely, 210203211030302 is an apocalyptic number.
10203211030302 is an abundant number, since it is smaller than the sum of its proper divisors (13663949276898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10203211030302 is a wasteful number, since it uses less digits than its factorization.
10203211030302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9944650157 (or 9944650151 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10203211030302 its reverse (20303011230201), we get a palindrome (30506222260503).
The spelling of 10203211030302 in words is "ten trillion, two hundred three billion, two hundred eleven million, thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •