Base | Representation |
---|---|
bin | 101110011001010111010011… |
… | …001011000000111000101100 |
3 | 222202111021211110102001211222 |
4 | 232121113103023000320230 |
5 | 203221201314400123302 |
6 | 2001552415331002512 |
7 | 60660232064153330 |
oct | 5631272313007054 |
9 | 882437743361758 |
10 | 204053144145452 |
11 | 5a0214a8240a88 |
12 | 1aa76a49139438 |
13 | 89b218a33aa14 |
14 | 385632109d7c0 |
15 | 188cd55957da2 |
hex | b995d32c0e2c |
204053144145452 has 48 divisors (see below), whose sum is σ = 411858972940800. Its totient is φ = 86650847712000.
The previous prime is 204053144145419. The next prime is 204053144145493. The reversal of 204053144145452 is 254541441350402.
It is a super-2 number, since 2×2040531441454522 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 74634674 + ... + 77320377.
It is an arithmetic number, because the mean of its divisors is an integer number (8580395269600).
Almost surely, 2204053144145452 is an apocalyptic number.
It is an amenable number.
204053144145452 is an abundant number, since it is smaller than the sum of its proper divisors (207805828795348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204053144145452 is a wasteful number, since it uses less digits than its factorization.
204053144145452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151955502 (or 151955500 counting only the distinct ones).
The product of its (nonzero) digits is 1536000, while the sum is 44.
Adding to 204053144145452 its reverse (254541441350402), we get a palindrome (458594585495854).
The spelling of 204053144145452 in words is "two hundred four trillion, fifty-three billion, one hundred forty-four million, one hundred forty-five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •