Base | Representation |
---|---|
bin | 1001010001110101011010… |
… | …0101100011001011001111 |
3 | 1100010022010220220001222200 |
4 | 2110131112211203023033 |
5 | 2314122144000340413 |
6 | 33410422322212543 |
7 | 2102033033203113 |
oct | 224352645431317 |
9 | 40108126801880 |
10 | 10202000011983 |
11 | 328370a04a88a |
12 | 11892711b4153 |
13 | 590076927330 |
14 | 273acaaad743 |
15 | 12a59dc7d573 |
hex | 947569632cf |
10202000011983 has 24 divisors (see below), whose sum is σ = 15875684418048. Its totient is φ = 6275817168192.
The previous prime is 10202000011963. The next prime is 10202000012023. The reversal of 10202000011983 is 38911000020201.
It is not a de Polignac number, because 10202000011983 - 26 = 10202000011919 is a prime.
It is a super-2 number, since 2×102020000119832 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202000011943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15911260 + ... + 16540017.
It is an arithmetic number, because the mean of its divisors is an integer number (661486850752).
Almost surely, 210202000011983 is an apocalyptic number.
10202000011983 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10202000011983 is a deficient number, since it is larger than the sum of its proper divisors (5673684406065).
10202000011983 is a wasteful number, since it uses less digits than its factorization.
10202000011983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32453983 (or 32453980 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The spelling of 10202000011983 in words is "ten trillion, two hundred two billion, eleven thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •