Base | Representation |
---|---|
bin | 11100010111101100… |
… | …00111110000010100 |
3 | 1110022111001012002101 |
4 | 32023312013300110 |
5 | 222143131404302 |
6 | 10555211451444 |
7 | 1046304255550 |
oct | 161366076024 |
9 | 43274035071 |
10 | 15231122452 |
11 | 6506631807 |
12 | 2b50a56b84 |
13 | 15896ac1c0 |
14 | a46bc8860 |
15 | 5e226a287 |
hex | 38bd87c14 |
15231122452 has 48 divisors (see below), whose sum is σ = 33343338112. Its totient is φ = 5926711680.
The previous prime is 15231122441. The next prime is 15231122471. The reversal of 15231122452 is 25422113251.
It is a happy number.
15231122452 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×152311224522 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 15231122452.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 320778 + ... + 365185.
Almost surely, 215231122452 is an apocalyptic number.
It is an amenable number.
15231122452 is an abundant number, since it is smaller than the sum of its proper divisors (18112215660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15231122452 is a wasteful number, since it uses less digits than its factorization.
15231122452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686048 (or 686046 counting only the distinct ones).
The product of its digits is 4800, while the sum is 28.
The spelling of 15231122452 in words is "fifteen billion, two hundred thirty-one million, one hundred twenty-two thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •