Base | Representation |
---|---|
bin | 100100011111100000110… |
… | …1011101000011110011110 |
3 | 122202110211011110100201100 |
4 | 1020333001223220132132 |
5 | 1124133143411300402 |
6 | 14400024502453530 |
7 | 1025233114633536 |
oct | 110770153503636 |
9 | 18673734410640 |
10 | 5015476275102 |
11 | 1664062671067 |
12 | 690048a342a6 |
13 | 2a4c5a4a96b7 |
14 | 134a70d484c6 |
15 | 8a6e626471c |
hex | 48fc1ae879e |
5015476275102 has 48 divisors (see below), whose sum is σ = 11415440743200. Its totient is φ = 1588404878016.
The previous prime is 5015476275067. The next prime is 5015476275109. The reversal of 5015476275102 is 2015726745105.
5015476275102 is a `hidden beast` number, since 5 + 0 + 1 + 5 + 4 + 7 + 627 + 5 + 10 + 2 = 666.
It is a super-2 number, since 2×50154762751022 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5015476275109) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 40591593 + ... + 40714964.
It is an arithmetic number, because the mean of its divisors is an integer number (237821682150).
Almost surely, 25015476275102 is an apocalyptic number.
5015476275102 is an abundant number, since it is smaller than the sum of its proper divisors (6399964468098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5015476275102 is a wasteful number, since it uses less digits than its factorization.
5015476275102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81306737 (or 81306734 counting only the distinct ones).
The product of its (nonzero) digits is 588000, while the sum is 45.
The spelling of 5015476275102 in words is "five trillion, fifteen billion, four hundred seventy-six million, two hundred seventy-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •