Base | Representation |
---|---|
bin | 1001011000110001001011… |
… | …0011111000010101111100 |
3 | 1100112200121201221011121222 |
4 | 2112030102303320111330 |
5 | 2323100124213033200 |
6 | 33541242532012512 |
7 | 2113451011335404 |
oct | 226142263702574 |
9 | 40480551834558 |
10 | 10321122002300 |
11 | 331a18833226a |
12 | 11a8376a61138 |
13 | 59b37bc47335 |
14 | 27978b581804 |
15 | 12d721aecd85 |
hex | 96312cf857c |
10321122002300 has 36 divisors (see below), whose sum is σ = 23169139397880. Its totient is φ = 3986088496320.
The previous prime is 10321122002297. The next prime is 10321122002327. The reversal of 10321122002300 is 320022112301.
10321122002300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103211220023002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1779500894 + ... + 1779506693.
Almost surely, 210321122002300 is an apocalyptic number.
10321122002300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10321122002300 is an abundant number, since it is smaller than the sum of its proper divisors (12848017395580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10321122002300 is a wasteful number, since it uses less digits than its factorization.
10321122002300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3559007630 (or 3559007623 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10321122002300 its reverse (320022112301), we get a palindrome (10641144114601).
The spelling of 10321122002300 in words is "ten trillion, three hundred twenty-one billion, one hundred twenty-two million, two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •