Base | Representation |
---|---|
bin | 10011010101011001001001… |
… | …11110000100101110001110 |
3 | 12120112112112002111101202212 |
4 | 21222230210332010232032 |
5 | 21033042243341441100 |
6 | 230231451113150422 |
7 | 11645500354015655 |
oct | 1152544476045616 |
9 | 176475462441685 |
10 | 42516501515150 |
11 | 1260216877a983 |
12 | 4927b963bb412 |
13 | 1a9539a8c8740 |
14 | a6db4998c19c |
15 | 4dae4238a635 |
hex | 26ab24f84b8e |
42516501515150 has 96 divisors (see below), whose sum is σ = 86132080944000. Its totient is φ = 15520508161920.
The previous prime is 42516501515149. The next prime is 42516501515161. The reversal of 42516501515150 is 5151510561524.
42516501515150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 42516501515098 and 42516501515107.
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 47 ways as a sum of consecutive naturals, for example, 34092917 + ... + 35317983.
It is an arithmetic number, because the mean of its divisors is an integer number (897209176500).
Almost surely, 242516501515150 is an apocalyptic number.
42516501515150 is an abundant number, since it is smaller than the sum of its proper divisors (43615579428850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42516501515150 is a wasteful number, since it uses less digits than its factorization.
42516501515150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1225698 (or 1225693 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 41.
The spelling of 42516501515150 in words is "forty-two trillion, five hundred sixteen billion, five hundred one million, five hundred fifteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •