Base | Representation |
---|---|
bin | 1110010000111100011… |
… | …01011011111000101001 |
3 | 1201212010012220210010202 |
4 | 13020132031123320221 |
5 | 31012243034012223 |
6 | 1013055233321545 |
7 | 50260645461200 |
oct | 7103615337051 |
9 | 1655105823122 |
10 | 490133110313 |
11 | 1799563aa210 |
12 | 7aba87062b5 |
13 | 372b0bc7a02 |
14 | 19a18a30237 |
15 | cb397ba428 |
hex | 721e35be29 |
490133110313 has 24 divisors (see below), whose sum is σ = 649030034880. Its totient is φ = 365316594720.
The previous prime is 490133110307. The next prime is 490133110339. The reversal of 490133110313 is 313011331094.
It is not a de Polignac number, because 490133110313 - 24 = 490133110297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (490133110393) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19755818 + ... + 19780611.
It is an arithmetic number, because the mean of its divisors is an integer number (27042918120).
Almost surely, 2490133110313 is an apocalyptic number.
It is an amenable number.
490133110313 is a deficient number, since it is larger than the sum of its proper divisors (158896924567).
490133110313 is a wasteful number, since it uses less digits than its factorization.
490133110313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39536477 (or 39536470 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 490133110313 in words is "four hundred ninety billion, one hundred thirty-three million, one hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •