Base | Representation |
---|---|
bin | 100101011110101011001… |
… | …1001010001100100010000 |
3 | 200020102221002010102012122 |
4 | 1022331112121101210100 |
5 | 1133343441001112112 |
6 | 14542220100513412 |
7 | 1041104303140646 |
oct | 112752631214420 |
9 | 20212832112178 |
10 | 5151115254032 |
11 | 17066372a9560 |
12 | 6b23a20ab868 |
13 | 2b4995705547 |
14 | 13b45b2c7196 |
15 | 8ded419b872 |
hex | 4af56651910 |
5151115254032 has 80 divisors (see below), whose sum is σ = 11361972608640. Its totient is φ = 2239415270400.
The previous prime is 5151115254011. The next prime is 5151115254049. The reversal of 5151115254032 is 2304525111515.
It is a junction number, because it is equal to n+sod(n) for n = 5151115253983 and 5151115254001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50909732 + ... + 51010812.
It is an arithmetic number, because the mean of its divisors is an integer number (142024657608).
Almost surely, 25151115254032 is an apocalyptic number.
It is an amenable number.
5151115254032 is an abundant number, since it is smaller than the sum of its proper divisors (6210857354608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5151115254032 is a wasteful number, since it uses less digits than its factorization.
5151115254032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113712 (or 113706 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 5151115254032 in words is "five trillion, one hundred fifty-one billion, one hundred fifteen million, two hundred fifty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •