Base | Representation |
---|---|
bin | 1011101110011110001… |
… | …0101111010011010000 |
3 | 201020222121121210200000 |
4 | 2323213202233103100 |
5 | 11300034000423102 |
6 | 232313555530000 |
7 | 20361124300206 |
oct | 2734742572320 |
9 | 636877553600 |
10 | 201453139152 |
11 | 78488055151 |
12 | 330622b9900 |
13 | 15cc63b4b25 |
14 | 9a710a7076 |
15 | 5390d1401c |
hex | 2ee78af4d0 |
201453139152 has 240 divisors, whose sum is σ = 620580280320. Its totient is φ = 63046066176.
The previous prime is 201453139117. The next prime is 201453139163. The reversal of 201453139152 is 251931354102.
It is a happy number.
201453139152 is a `hidden beast` number, since 20 + 1 + 453 + 1 + 39 + 152 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 28616049 + ... + 28623087.
It is an arithmetic number, because the mean of its divisors is an integer number (2585751168).
Almost surely, 2201453139152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201453139152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (310290140160).
201453139152 is an abundant number, since it is smaller than the sum of its proper divisors (419127141168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201453139152 is a wasteful number, since it uses less digits than its factorization.
201453139152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7512 (or 7494 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 201453139152 in words is "two hundred one billion, four hundred fifty-three million, one hundred thirty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.229 sec. • engine limits •