Base | Representation |
---|---|
bin | 101101110110011110100000… |
… | …1111111010100001100011001 |
3 | 1221220000012021101022002011102 |
4 | 1123230331001333110030121 |
5 | 410330323242301104423 |
6 | 3545434413053441145 |
7 | 150644200663653002 |
oct | 13354750177241431 |
9 | 1856005241262142 |
10 | 403311421113113 |
11 | 10756445aa02a27 |
12 | 39298556aa01b5 |
13 | 14407147128446 |
14 | 718453c4521a9 |
15 | 31960c7a54c28 |
hex | 16ecf41fd4319 |
403311421113113 has 8 divisors (see below), whose sum is σ = 423633764535936. Its totient is φ = 383221333044000.
The previous prime is 403311421113077. The next prime is 403311421113157. The reversal of 403311421113113 is 311311124113304.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 403311421113113 - 26 = 403311421113049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (403311421193113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58063834868 + ... + 58063841813.
It is an arithmetic number, because the mean of its divisors is an integer number (52954220566992).
Almost surely, 2403311421113113 is an apocalyptic number.
It is an amenable number.
403311421113113 is a deficient number, since it is larger than the sum of its proper divisors (20322343422823).
403311421113113 is a wasteful number, since it uses less digits than its factorization.
403311421113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116127676855.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 403311421113113 its reverse (311311124113304), we get a palindrome (714622545226417).
The spelling of 403311421113113 in words is "four hundred three trillion, three hundred eleven billion, four hundred twenty-one million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •