Base | Representation |
---|---|
bin | 1000011110110010… |
… | …10010110110110100 |
3 | 102202022202101111220 |
4 | 10033121102312310 |
5 | 33311113200442 |
6 | 2031452030340 |
7 | 220556016630 |
oct | 41731226664 |
9 | 12668671456 |
10 | 4553256372 |
11 | 1a272159a5 |
12 | a70a623b0 |
13 | 577432152 |
14 | 312a0ddc0 |
15 | 1b9b0ceec |
hex | 10f652db4 |
4553256372 has 24 divisors (see below), whose sum is σ = 12142017216. Its totient is φ = 1300930368.
The previous prime is 4553256359. The next prime is 4553256377. The reversal of 4553256372 is 2736523554.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4553256377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27102633 + ... + 27102800.
It is an arithmetic number, because the mean of its divisors is an integer number (505917384).
Almost surely, 24553256372 is an apocalyptic number.
4553256372 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
4553256372 is an abundant number, since it is smaller than the sum of its proper divisors (7588760844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4553256372 is a wasteful number, since it uses less digits than its factorization.
4553256372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54205447 (or 54205445 counting only the distinct ones).
The product of its digits is 756000, while the sum is 42.
The square root of 4553256372 is about 67477.8213341243. The cubic root of 4553256372 is about 1657.4510127047.
The spelling of 4553256372 in words is "four billion, five hundred fifty-three million, two hundred fifty-six thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •