Base | Representation |
---|---|
bin | 101101101001000… |
… | …0001111011100000 |
3 | 10221201200212210010 |
4 | 1123102001323200 |
5 | 11114023000102 |
6 | 411544204520 |
7 | 52644064665 |
oct | 13322017340 |
9 | 3851625703 |
10 | 1531453152 |
11 | 716513469 |
12 | 368a69740 |
13 | 1b53857c8 |
14 | 10756da6c |
15 | 8e6add6c |
hex | 5b481ee0 |
1531453152 has 48 divisors (see below), whose sum is σ = 4023008640. Its totient is φ = 510110592.
The previous prime is 1531453151. The next prime is 1531453153. The reversal of 1531453152 is 2513541351.
It is an interprime number because it is at equal distance from previous prime (1531453151) and next prime (1531453153).
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1531453151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146533 + ... + 156635.
It is an arithmetic number, because the mean of its divisors is an integer number (83812680).
Almost surely, 21531453152 is an apocalyptic number.
1531453152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1531453152 is an abundant number, since it is smaller than the sum of its proper divisors (2491555488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1531453152 is a wasteful number, since it uses less digits than its factorization.
1531453152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11695 (or 11687 counting only the distinct ones).
The product of its digits is 9000, while the sum is 30.
The square root of 1531453152 is about 39133.7853011947. The cubic root of 1531453152 is about 1152.6600432424.
The spelling of 1531453152 in words is "one billion, five hundred thirty-one million, four hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •