Base | Representation |
---|---|
bin | 100011101011100111100… |
… | …1001110011110110010001 |
3 | 122100211011111112112022020 |
4 | 1013113033021303312101 |
5 | 1120321424440440423 |
6 | 14232514241402053 |
7 | 1014206340624462 |
oct | 107271711636621 |
9 | 18324144475266 |
10 | 4904033140113 |
11 | 1620874950308 |
12 | 672526939329 |
13 | 2975aa00a583 |
14 | 12d4dc224d69 |
15 | 878726064e3 |
hex | 475cf273d91 |
4904033140113 has 64 divisors (see below), whose sum is σ = 6984878014464. Its totient is φ = 3055345920000.
The previous prime is 4904033140109. The next prime is 4904033140159. The reversal of 4904033140113 is 3110413304094.
It is not a de Polignac number, because 4904033140113 - 22 = 4904033140109 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4904033180113) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 162925881 + ... + 162955977.
It is an arithmetic number, because the mean of its divisors is an integer number (109138718976).
Almost surely, 24904033140113 is an apocalyptic number.
It is an amenable number.
4904033140113 is a deficient number, since it is larger than the sum of its proper divisors (2080844874351).
4904033140113 is a wasteful number, since it uses less digits than its factorization.
4904033140113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30606.
The product of its (nonzero) digits is 15552, while the sum is 33.
The spelling of 4904033140113 in words is "four trillion, nine hundred four billion, thirty-three million, one hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •