Base | Representation |
---|---|
bin | 11100000010010110… |
… | …01110010101011101 |
3 | 1102212000012011101100 |
4 | 32001023032111131 |
5 | 221311314330203 |
6 | 10525334503313 |
7 | 1042001532126 |
oct | 160113162535 |
9 | 42760164340 |
10 | 15052105053 |
11 | 6424580347 |
12 | 2b00b04b39 |
13 | 155b59064b |
14 | a2b10904d |
15 | 5d16a7ea3 |
hex | 3812ce55d |
15052105053 has 24 divisors (see below), whose sum is σ = 21956684256. Its totient is φ = 9935719200.
The previous prime is 15052105039. The next prime is 15052105097. The reversal of 15052105053 is 35050125051.
15052105053 is a `hidden beast` number, since 1 + 505 + 2 + 105 + 0 + 53 = 666.
15052105053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15052105053 - 25 = 15052105021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15052100053) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2858443 + ... + 2863703.
It is an arithmetic number, because the mean of its divisors is an integer number (914861844).
Almost surely, 215052105053 is an apocalyptic number.
It is an amenable number.
15052105053 is a deficient number, since it is larger than the sum of its proper divisors (6904579203).
15052105053 is a wasteful number, since it uses less digits than its factorization.
15052105053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8345 (or 8342 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 15052105053 in words is "fifteen billion, fifty-two million, one hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •