Base | Representation |
---|---|
bin | 101101100010000111000001… |
… | …111110101001101010001011 |
3 | 222021001022000020121211200100 |
4 | 231202013001332221222023 |
5 | 202221444000234233001 |
6 | 1545524215011540443 |
7 | 60116011645443465 |
oct | 5542070176515213 |
9 | 867038006554610 |
10 | 200256104602251 |
11 | 58898156422625 |
12 | 1a562b842ba723 |
13 | 87980b9cac049 |
14 | 37646390b3135 |
15 | 18241c2ca4586 |
hex | b621c1fa9a8b |
200256104602251 has 24 divisors (see below), whose sum is σ = 304879170332880. Its totient is φ = 126468396565056.
The previous prime is 200256104602247. The next prime is 200256104602259. The reversal of 200256104602251 is 152206401652002.
200256104602251 is a `hidden beast` number, since 2 + 0 + 0 + 2 + 561 + 0 + 46 + 0 + 2 + 2 + 51 = 666.
200256104602251 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 200256104602251 - 22 = 200256104602247 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200256104602259) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7238333041 + ... + 7238360706.
It is an arithmetic number, because the mean of its divisors is an integer number (12703298763870).
Almost surely, 2200256104602251 is an apocalyptic number.
200256104602251 is a deficient number, since it is larger than the sum of its proper divisors (104623065730629).
200256104602251 is a wasteful number, since it uses less digits than its factorization.
200256104602251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14476693835 (or 14476693832 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 200256104602251 in words is "two hundred trillion, two hundred fifty-six billion, one hundred four million, six hundred two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •