Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1000101011010011011101 |
3 | 1100010010001000020221211012 |
4 | 2110123200220223103131 |
5 | 2314104120401321341 |
6 | 33405454111505005 |
7 | 2101633013664302 |
oct | 224334050532335 |
9 | 40103030227735 |
10 | 10200021120221 |
11 | 3282894010149 |
12 | 11889ba528165 |
13 | 58cb1c96096a |
14 | 27397dd4b0a9 |
15 | 12a4d518a0eb |
hex | 946e0a2b4dd |
10200021120221 has 8 divisors (see below), whose sum is σ = 10340178799104. Its totient is φ = 10060631429200.
The previous prime is 10200021120209. The next prime is 10200021120271. The reversal of 10200021120221 is 12202112000201.
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 10200021120221 - 230 = 10198947378397 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200021120196 and 10200021120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200021120271) 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, 191970221 + ... + 192023346.
It is an arithmetic number, because the mean of its divisors is an integer number (1292522349888).
Almost surely, 210200021120221 is an apocalyptic number.
It is an amenable number.
10200021120221 is a deficient number, since it is larger than the sum of its proper divisors (140157678883).
10200021120221 is a wasteful number, since it uses less digits than its factorization.
10200021120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383993931.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10200021120221 its reverse (12202112000201), we get a palindrome (22402133120422).
The spelling of 10200021120221 in words is "ten trillion, two hundred billion, twenty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •