Base | Representation |
---|---|
bin | 1001010001101110011010… |
… | …0001111111011100101101 |
3 | 1100010010021220101010221011 |
4 | 2110123212201333130231 |
5 | 2314104321211443041 |
6 | 33405512003505221 |
7 | 2101635324502054 |
oct | 224334641773455 |
9 | 40103256333834 |
10 | 10200120031021 |
11 | 3282934928308 |
12 | 1188a27688211 |
13 | 58cb372b276b |
14 | 27398d13739b |
15 | 12a4ddbc6e81 |
hex | 946e687f72d |
10200120031021 has 8 divisors (see below), whose sum is σ = 10236537057600. Its totient is φ = 10163703839520.
The previous prime is 10200120030889. The next prime is 10200120031043. The reversal of 10200120031021 is 12013002100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10200120031021 - 227 = 10199985813293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200120030992 and 10200120031010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200120031051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34590120 + ... + 34883758.
It is an arithmetic number, because the mean of its divisors is an integer number (1279567132200).
Almost surely, 210200120031021 is an apocalyptic number.
It is an amenable number.
10200120031021 is a deficient number, since it is larger than the sum of its proper divisors (36417026579).
10200120031021 is a wasteful number, since it uses less digits than its factorization.
10200120031021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417539.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10200120031021 its reverse (12013002100201), we get a palindrome (22213122131222).
The spelling of 10200120031021 in words is "ten trillion, two hundred billion, one hundred twenty million, thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •