Base | Representation |
---|---|
bin | 1101110010111001010… |
… | …00000100011000010011 |
3 | 1200022110220101200220121 |
4 | 12321130220010120103 |
5 | 30231223101111011 |
6 | 1001430333451111 |
7 | 46150113002653 |
oct | 6713450043023 |
9 | 1608426350817 |
10 | 474000410131 |
11 | 173027968846 |
12 | 77a45940a97 |
13 | 3590c7bbc81 |
14 | 18d281d8363 |
15 | c4e3310e71 |
hex | 6e5ca04613 |
474000410131 has 4 divisors (see below), whose sum is σ = 474012529200. Its totient is φ = 473988291064.
The previous prime is 474000410053. The next prime is 474000410137. The reversal of 474000410131 is 131014000474.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 474000410131 - 213 = 474000401939 is a prime.
It is a super-2 number, since 2×4740004101312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 474000410096 and 474000410105.
It is not an unprimeable number, because it can be changed into a prime (474000410137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6000676 + ... + 6079153.
It is an arithmetic number, because the mean of its divisors is an integer number (118503132300).
Almost surely, 2474000410131 is an apocalyptic number.
474000410131 is a deficient number, since it is larger than the sum of its proper divisors (12119069).
474000410131 is a wasteful number, since it uses less digits than its factorization.
474000410131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12119068.
The product of its (nonzero) digits is 1344, while the sum is 25.
The spelling of 474000410131 in words is "four hundred seventy-four billion, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •