Base | Representation |
---|---|
bin | 1001010111101110011100… |
… | …1011000011100101111000 |
3 | 1100110222101102100201211210 |
4 | 2111323213023003211320 |
5 | 2322301433230323000 |
6 | 33525121311523120 |
7 | 2112245102043414 |
oct | 225734713034570 |
9 | 40428342321753 |
10 | 10303210011000 |
11 | 33126264a1075 |
12 | 11a49b82294a0 |
13 | 59978601c50a |
14 | 27896c703d44 |
15 | 12d02432b350 |
hex | 95ee72c3978 |
10303210011000 has 128 divisors (see below), whose sum is σ = 32147937020160. Its totient is φ = 2747358416000.
The previous prime is 10303210010987. The next prime is 10303210011037. The reversal of 10303210011000 is 11001230301.
It is a super-2 number, since 2×103032100110002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
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, 55019527 + ... + 55206473.
It is an arithmetic number, because the mean of its divisors is an integer number (251155757970).
Almost surely, 210303210011000 is an apocalyptic number.
10303210011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10303210011000 is an abundant number, since it is smaller than the sum of its proper divisors (21844727009160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10303210011000 is a wasteful number, since it uses less digits than its factorization.
10303210011000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205342 (or 205328 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10303210011000 its reverse (11001230301), we get a palindrome (10314211241301).
The spelling of 10303210011000 in words is "ten trillion, three hundred three billion, two hundred ten million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •