Base | Representation |
---|---|
bin | 100100110001111010110… |
… | …0000100101010011100111 |
3 | 122220020211200020222200200 |
4 | 1021203311200211103213 |
5 | 1130310120111440211 |
6 | 14430122444041543 |
7 | 1031132424202341 |
oct | 111436540452347 |
9 | 18806750228620 |
10 | 5055000499431 |
11 | 16798a4aa8873 |
12 | 6978395332b3 |
13 | 2a88b8b08c9c |
14 | 136940268291 |
15 | 8b75b0bab56 |
hex | 498f58254e7 |
5055000499431 has 12 divisors (see below), whose sum is σ = 7301754676320. Its totient is φ = 3369960046080.
The previous prime is 5055000499429. The next prime is 5055000499433. The reversal of 5055000499431 is 1349940005505.
5055000499431 is a `hidden beast` number, since 5 + 0 + 550 + 0 + 0 + 4 + 9 + 94 + 3 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (5055000499429) and next prime (5055000499433).
It is not a de Polignac number, because 5055000499431 - 21 = 5055000499429 is a prime.
It is a super-2 number, since 2×50550004994312 (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 (5055000499433) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2552410 + ... + 4077351.
It is an arithmetic number, because the mean of its divisors is an integer number (608479556360).
Almost surely, 25055000499431 is an apocalyptic number.
5055000499431 is a deficient number, since it is larger than the sum of its proper divisors (2246754176889).
5055000499431 is a wasteful number, since it uses less digits than its factorization.
5055000499431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6714486 (or 6714483 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 45.
The spelling of 5055000499431 in words is "five trillion, fifty-five billion, four hundred ninety-nine thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •