Base | Representation |
---|---|
bin | 11000000000111… |
… | …11110011100000 |
3 | 112001002001212100 |
4 | 30000133303200 |
5 | 403033104424 |
6 | 31553530400 |
7 | 4664232540 |
oct | 1400376340 |
9 | 461061770 |
10 | 201456864 |
11 | a3798584 |
12 | 57573a00 |
13 | 3297745b |
14 | 1ca81320 |
15 | 12a45dc9 |
hex | c01fce0 |
201456864 has 72 divisors (see below), whose sum is σ = 654741360. Its totient is φ = 57558528.
The previous prime is 201456863. The next prime is 201456889. The reversal of 201456864 is 468654102.
201456864 is a `hidden beast` number, since 20 + 14 + 568 + 64 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a zygodrome in base 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201456863) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47949 + ... + 51980.
It is an arithmetic number, because the mean of its divisors is an integer number (9093630).
Almost surely, 2201456864 is an apocalyptic number.
201456864 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
201456864 is an abundant number, since it is smaller than the sum of its proper divisors (453284496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201456864 is a wasteful number, since it uses less digits than its factorization.
201456864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99952 (or 99941 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The square root of 201456864 is about 14193.5500844574. The cubic root of 201456864 is about 586.2200790933.
The spelling of 201456864 in words is "two hundred one million, four hundred fifty-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •