Base | Representation |
---|---|
bin | 100100100010010100100… |
… | …0001100011111111100011 |
3 | 122210001101022122120112000 |
4 | 1021010221001203333203 |
5 | 1124233020242410301 |
6 | 14402503024135043 |
7 | 1025535401423550 |
oct | 111045101437743 |
9 | 18701338576460 |
10 | 5021505044451 |
11 | 1666676761775 |
12 | 69124ba67483 |
13 | 2a56ab50923c |
14 | 1350838c5a27 |
15 | 8a94a681786 |
hex | 49129063fe3 |
5021505044451 has 32 divisors (see below), whose sum is σ = 8525185505280. Its totient is φ = 2861612800128.
The previous prime is 5021505044449. The next prime is 5021505044459. The reversal of 5021505044451 is 1544405051205.
5021505044451 is a `hidden beast` number, since 5 + 0 + 2 + 150 + 50 + 4 + 4 + 451 = 666.
5021505044451 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5021505044451 - 21 = 5021505044449 is a prime.
It is a super-2 number, since 2×50215050444512 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5021505044459) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36127926 + ... + 36266651.
It is an arithmetic number, because the mean of its divisors is an integer number (266412047040).
Almost surely, 25021505044451 is an apocalyptic number.
5021505044451 is a deficient number, since it is larger than the sum of its proper divisors (3503680460829).
5021505044451 is a wasteful number, since it uses less digits than its factorization.
5021505044451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72394960 (or 72394954 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 36.
The spelling of 5021505044451 in words is "five trillion, twenty-one billion, five hundred five million, forty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.260 sec. • engine limits •