Base | Representation |
---|---|
bin | 1110010001011100011… |
… | …00110000000000001011 |
3 | 1201212210220200120210120 |
4 | 13020232030300000023 |
5 | 31013320222203102 |
6 | 1013142015114323 |
7 | 50300413555626 |
oct | 7105614600013 |
9 | 1655726616716 |
10 | 490401366027 |
11 | 179a83871751 |
12 | 7b0625129a3 |
13 | 3732465c8c1 |
14 | 19a424dcdbd |
15 | cb531086bc |
hex | 722e33000b |
490401366027 has 4 divisors (see below), whose sum is σ = 653868488040. Its totient is φ = 326934244016.
The previous prime is 490401366011. The next prime is 490401366041. The reversal of 490401366027 is 720663104094.
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 490401366027 - 24 = 490401366011 is a prime.
It is a super-2 number, since 2×4904013660272 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 490401366027.
It is not an unprimeable number, because it can be changed into a prime (490401366067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81733561002 + ... + 81733561007.
It is an arithmetic number, because the mean of its divisors is an integer number (163467122010).
Almost surely, 2490401366027 is an apocalyptic number.
490401366027 is a deficient number, since it is larger than the sum of its proper divisors (163467122013).
490401366027 is a wasteful number, since it uses less digits than its factorization.
490401366027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163467122012.
The product of its (nonzero) digits is 217728, while the sum is 42.
The spelling of 490401366027 in words is "four hundred ninety billion, four hundred one million, three hundred sixty-six thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •