Base | Representation |
---|---|
bin | 100100100011100101000… |
… | …100110101100000001101 |
3 | 22220011011212011010221110 |
4 | 210203211010311200031 |
5 | 312124242130313203 |
6 | 5202013354122233 |
7 | 346331165652510 |
oct | 44434504654015 |
9 | 8804155133843 |
10 | 2512104151053 |
11 | 889417337102 |
12 | 346a42720379 |
13 | 152b762b19b3 |
14 | 8982d482d77 |
15 | 4552b5a5d03 |
hex | 248e513580d |
2512104151053 has 32 divisors (see below), whose sum is σ = 4002741043200. Its totient is φ = 1370208888576.
The previous prime is 2512104151013. The next prime is 2512104151057. The reversal of 2512104151053 is 3501514012152.
It is not a de Polignac number, because 2512104151053 - 29 = 2512104150541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2512104151053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2512104151057) 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 31 ways as a sum of consecutive naturals, for example, 5197708 + ... + 5660421.
It is an arithmetic number, because the mean of its divisors is an integer number (125085657600).
Almost surely, 22512104151053 is an apocalyptic number.
2512104151053 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2512104151053 is a deficient number, since it is larger than the sum of its proper divisors (1490636892147).
2512104151053 is a wasteful number, since it uses less digits than its factorization.
2512104151053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10858641.
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 2512104151053 in words is "two trillion, five hundred twelve billion, one hundred four million, one hundred fifty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •