Base | Representation |
---|---|
bin | 10010001011100… |
… | …10101100011110 |
3 | 101121222110221010 |
4 | 21011302230132 |
5 | 303020411220 |
6 | 23044520050 |
7 | 3531225135 |
oct | 1105625436 |
9 | 347873833 |
10 | 152513310 |
11 | 790a9564 |
12 | 430b0026 |
13 | 2579bb81 |
14 | 1638091c |
15 | d5c91e0 |
hex | 9172b1e |
152513310 has 32 divisors (see below), whose sum is σ = 366747552. Its totient is φ = 40590720.
The previous prime is 152513293. The next prime is 152513311. The reversal of 152513310 is 13315251.
152513310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1525133102 = 46520619454312200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152513311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11532 + ... + 20928.
It is an arithmetic number, because the mean of its divisors is an integer number (11460861).
Almost surely, 2152513310 is an apocalyptic number.
152513310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
152513310 is an abundant number, since it is smaller than the sum of its proper divisors (214234242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152513310 is a wasteful number, since it uses less digits than its factorization.
152513310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9948.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 152513310 is about 12349.6279296180. The cubic root of 152513310 is about 534.2804079345.
Adding to 152513310 its reverse (13315251), we get a palindrome (165828561).
The spelling of 152513310 in words is "one hundred fifty-two million, five hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •