Base | Representation |
---|---|
bin | 100100100110111100111… |
… | …0011111001001000010101 |
3 | 122211000001102111110002201 |
4 | 1021031321303321020111 |
5 | 1124413402242200401 |
6 | 14411225534404501 |
7 | 1026340013220010 |
oct | 111157163711025 |
9 | 18730042443081 |
10 | 5031450350101 |
11 | 166a90a60a03a |
12 | 693166660731 |
13 | 2a6604a86696 |
14 | 13574868c377 |
15 | 8ad2d838b01 |
hex | 49379cf9215 |
5031450350101 has 16 divisors (see below), whose sum is σ = 6090237400320. Its totient is φ = 4057812046080.
The previous prime is 5031450350083. The next prime is 5031450350149. The reversal of 5031450350101 is 1010530541305.
It is not a de Polignac number, because 5031450350101 - 211 = 5031450348053 is a prime.
It is a super-6 number, since 6×50314503501016 (a number of 77 digits) contains 666666 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5031450350101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5031450350191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5696361 + ... + 6520078.
It is an arithmetic number, because the mean of its divisors is an integer number (380639837520).
Almost surely, 25031450350101 is an apocalyptic number.
It is an amenable number.
5031450350101 is a deficient number, since it is larger than the sum of its proper divisors (1058787050219).
5031450350101 is a wasteful number, since it uses less digits than its factorization.
5031450350101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12219924.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 5031450350101 its reverse (1010530541305), we get a palindrome (6041980891406).
The spelling of 5031450350101 in words is "five trillion, thirty-one billion, four hundred fifty million, three hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •