Base | Representation |
---|---|
bin | 1101101001110101100011… |
… | …0101000010111001110100 |
3 | 1222011011122001000110020210 |
4 | 3122131120311002321310 |
5 | 3431430344124000202 |
6 | 51532333554025420 |
7 | 3106416202021521 |
oct | 332353065027164 |
9 | 58134561013223 |
10 | 15012401000052 |
11 | 48687a5aa0455 |
12 | 1825606878270 |
13 | 84b881485b31 |
14 | 39c865878148 |
15 | 1b07911e4c6c |
hex | da758d42e74 |
15012401000052 has 24 divisors (see below), whose sum is σ = 35033224977856. Its totient is φ = 5003520907968.
The previous prime is 15012401000041. The next prime is 15012401000083. The reversal of 15012401000052 is 25000010421051.
It is a junction number, because it is equal to n+sod(n) for n = 15012400999992 and 15012401000028.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76492753 + ... + 76688760.
Almost surely, 215012401000052 is an apocalyptic number.
15012401000052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
15012401000052 is an abundant number, since it is smaller than the sum of its proper divisors (20020823977804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15012401000052 is a wasteful number, since it uses less digits than its factorization.
15012401000052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153189687 (or 153189685 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 21.
The spelling of 15012401000052 in words is "fifteen trillion, twelve billion, four hundred one million, fifty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •