Base | Representation |
---|---|
bin | 10011100110100000… |
… | …11001111110110000 |
3 | 1000011102001001002011 |
4 | 21303100121332300 |
5 | 133023021141102 |
6 | 4500125332304 |
7 | 521533152511 |
oct | 116320317660 |
9 | 30142031064 |
10 | 10523615152 |
11 | 4510340906 |
12 | 2058407094 |
13 | cb932031b |
14 | 71b904a08 |
15 | 418d3d2d7 |
hex | 273419fb0 |
10523615152 has 40 divisors (see below), whose sum is σ = 20824760880. Its totient is φ = 5150649600.
The previous prime is 10523615129. The next prime is 10523615171. The reversal of 10523615152 is 25151632501.
10523615152 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×105236151522 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
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, 108402 + ... + 181102.
It is an arithmetic number, because the mean of its divisors is an integer number (520619022).
Almost surely, 210523615152 is an apocalyptic number.
It is an amenable number.
10523615152 is a deficient number, since it is larger than the sum of its proper divisors (10301145728).
10523615152 is a wasteful number, since it uses less digits than its factorization.
10523615152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72901 (or 72895 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 10523615152 in words is "ten billion, five hundred twenty-three million, six hundred fifteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.874 sec. • engine limits •