Base | Representation |
---|---|
bin | 1011110000101000011… |
… | …1001101001010101101 |
3 | 201022111000222002022210 |
4 | 2330022013031022231 |
5 | 11302230434432023 |
6 | 232451315001033 |
7 | 20411366135160 |
oct | 2741207151255 |
9 | 638430862283 |
10 | 202033124013 |
11 | 78755482386 |
12 | 331a4599179 |
13 | 160895c3436 |
14 | 9ac811dad7 |
15 | 53c6bcb593 |
hex | 2f0a1cd2ad |
202033124013 has 16 divisors (see below), whose sum is σ = 307879072256. Its totient is φ = 115440346800.
The previous prime is 202033123997. The next prime is 202033124113. The reversal of 202033124013 is 310421330202.
202033124013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202033124013 - 24 = 202033123997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202033124113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58938 + ... + 638388.
It is an arithmetic number, because the mean of its divisors is an integer number (19242442016).
Almost surely, 2202033124013 is an apocalyptic number.
It is an amenable number.
202033124013 is a deficient number, since it is larger than the sum of its proper divisors (105845948243).
202033124013 is a wasteful number, since it uses less digits than its factorization.
202033124013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596064.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 202033124013 its reverse (310421330202), we get a palindrome (512454454215).
The spelling of 202033124013 in words is "two hundred two billion, thirty-three million, one hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •