Base | Representation |
---|---|
bin | 1011110000101101100… |
… | …1001010110001011100 |
3 | 201022112112101200120112 |
4 | 2330023121022301130 |
5 | 11302301440010022 |
6 | 232453403305152 |
7 | 20412046563443 |
oct | 2741331126134 |
9 | 638475350515 |
10 | 202054610012 |
11 | 78766618102 |
12 | 331ab81b1b8 |
13 | 16090ba7048 |
14 | 9acad13d5a |
15 | 53c8a228e2 |
hex | 2f0b64ac5c |
202054610012 has 12 divisors (see below), whose sum is σ = 368969288016. Its totient is φ = 96634813440.
The previous prime is 202054610011. The next prime is 202054610027. The reversal of 202054610012 is 210016450202.
It is a happy number.
202054610012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 202054610012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202054610011) 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 3 ways as a sum of consecutive naturals, for example, 1098122789 + ... + 1098122972.
It is an arithmetic number, because the mean of its divisors is an integer number (30747440668).
Almost surely, 2202054610012 is an apocalyptic number.
It is an amenable number.
202054610012 is a deficient number, since it is larger than the sum of its proper divisors (166914678004).
202054610012 is a wasteful number, since it uses less digits than its factorization.
202054610012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2196245788 (or 2196245786 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
The spelling of 202054610012 in words is "two hundred two billion, fifty-four million, six hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •