Base | Representation |
---|---|
bin | 10010111010000111… |
… | …00010111100100100 |
3 | 222012110011121102200 |
4 | 21131003202330210 |
5 | 131242143122002 |
6 | 4355142134500 |
7 | 506361211443 |
oct | 113503427444 |
9 | 28173147380 |
10 | 10151145252 |
11 | 433a069746 |
12 | 1b73721430 |
13 | c5a0ca731 |
14 | 6c4268d5a |
15 | 3e62b6b1c |
hex | 25d0e2f24 |
10151145252 has 36 divisors (see below), whose sum is σ = 25671953580. Its totient is φ = 3382117632.
The previous prime is 10151145241. The next prime is 10151145253. The reversal of 10151145252 is 25254115101.
It is a happy number.
10151145252 is a `hidden beast` number, since 10 + 15 + 114 + 525 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5432279616 + 4718865636 = 73704^2 + 68694^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (10151145253) 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, 12024 + ... + 142992.
Almost surely, 210151145252 is an apocalyptic number.
10151145252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10151145252 is an abundant number, since it is smaller than the sum of its proper divisors (15520808328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151145252 is a wasteful number, since it uses less digits than its factorization.
10151145252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133132 (or 133127 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
It can be divided in two parts, 10151 and 145252, that added together give a triangular number (155403 = T557).
The spelling of 10151145252 in words is "ten billion, one hundred fifty-one million, one hundred forty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •