Base | Representation |
---|---|
bin | 101111110000001101010011… |
… | …101100101001101001110111 |
3 | 1000112121210221021220221222002 |
4 | 233300031103230221221313 |
5 | 210011441012031132413 |
6 | 2022402153044125515 |
7 | 62144342262134450 |
oct | 5760152354515167 |
9 | 1015553837827862 |
10 | 210021010020983 |
11 | 60a12456a14077 |
12 | 1b67b58b39689b |
13 | 9025b8612a485 |
14 | 39c10dd234127 |
15 | 19431dd75d958 |
hex | bf0353b29a77 |
210021010020983 has 64 divisors (see below), whose sum is σ = 251547626373120. Its totient is φ = 171553282992000.
The previous prime is 210021010020919. The next prime is 210021010020989. The reversal of 210021010020983 is 389020010120012.
It is not a de Polignac number, because 210021010020983 - 26 = 210021010020919 is a prime.
It is a super-2 number, since 2×2100210100209832 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210021010020989) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14553454778 + ... + 14553469208.
It is an arithmetic number, because the mean of its divisors is an integer number (3930431662080).
Almost surely, 2210021010020983 is an apocalyptic number.
210021010020983 is a deficient number, since it is larger than the sum of its proper divisors (41526616352137).
210021010020983 is a wasteful number, since it uses less digits than its factorization.
210021010020983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17628.
The product of its (nonzero) digits is 1728, while the sum is 29.
Adding to 210021010020983 its reverse (389020010120012), we get a palindrome (599041020140995).
The spelling of 210021010020983 in words is "two hundred ten trillion, twenty-one billion, ten million, twenty thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •