Base | Representation |
---|---|
bin | 100100110001010010111… |
… | …1110010011111110110011 |
3 | 122220010101200101021001212 |
4 | 1021202211332103332303 |
5 | 1130244402011144012 |
6 | 14425342215350335 |
7 | 1031054362134242 |
oct | 111424576237663 |
9 | 18803350337055 |
10 | 5053666115507 |
11 | 167927a856439 |
12 | 6975266823ab |
13 | 2a87355227b9 |
14 | 136854d56959 |
15 | 8b6cdd87b22 |
hex | 498a5f93fb3 |
5053666115507 has 8 divisors (see below), whose sum is σ = 5221595151360. Its totient is φ = 4886043801480.
The previous prime is 5053666115501. The next prime is 5053666115513. The reversal of 5053666115507 is 7055116663505.
It is an interprime number because it is at equal distance from previous prime (5053666115501) and next prime (5053666115513).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5053666115507 - 224 = 5053649338291 is a prime.
It is a super-2 number, since 2×50536661155072 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5053666115501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76646957 + ... + 76712862.
It is an arithmetic number, because the mean of its divisors is an integer number (652699393920).
Almost surely, 25053666115507 is an apocalyptic number.
5053666115507 is a deficient number, since it is larger than the sum of its proper divisors (167929035853).
5053666115507 is a wasteful number, since it uses less digits than its factorization.
5053666115507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153360913.
The product of its (nonzero) digits is 2835000, while the sum is 50.
The spelling of 5053666115507 in words is "five trillion, fifty-three billion, six hundred sixty-six million, one hundred fifteen thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •