Base | Representation |
---|---|
bin | 101101100001101010100001… |
… | …110101101111110010000100 |
3 | 222020221101000101211202201101 |
4 | 231201222201311233302010 |
5 | 202220443311130013202 |
6 | 1545502154122305444 |
7 | 60113546363105206 |
oct | 5541524165576204 |
9 | 866841011752641 |
10 | 200225500626052 |
11 | 58886181265310 |
12 | 1a559063058284 |
13 | 87952507585a5 |
14 | 3762d74768776 |
15 | 18234d1124887 |
hex | b61aa1d6fc84 |
200225500626052 has 24 divisors (see below), whose sum is σ = 384384150531360. Its totient is φ = 90503146546560.
The previous prime is 200225500625999. The next prime is 200225500626061. The reversal of 200225500626052 is 250626005522002.
It is a happy number.
200225500626052 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2002255006260522 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12711108213 + ... + 12711123964.
It is an arithmetic number, because the mean of its divisors is an integer number (16016006272140).
Almost surely, 2200225500626052 is an apocalyptic number.
200225500626052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200225500626052 is a deficient number, since it is larger than the sum of its proper divisors (184158649905308).
200225500626052 is a wasteful number, since it uses less digits than its factorization.
200225500626052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25422232371 (or 25422232369 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 200225500626052 in words is "two hundred trillion, two hundred twenty-five billion, five hundred million, six hundred twenty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •