Base | Representation |
---|---|
bin | 10100011101101110101… |
… | …011110111110011101011 |
3 | 11222102221020211001220222 |
4 | 110131232223313303223 |
5 | 141020111143102311 |
6 | 2554014523440255 |
7 | 203413463551400 |
oct | 24355653676353 |
9 | 4872836731828 |
10 | 1406311300331 |
11 | 4a2460080683 |
12 | 1a867698608b |
13 | a27cb329102 |
14 | 4c0cc8d02a7 |
15 | 268ac289adb |
hex | 1476eaf7ceb |
1406311300331 has 12 divisors (see below), whose sum is σ = 1637965779408. Its totient is φ = 1203897218832.
The previous prime is 1406311300321. The next prime is 1406311300333. The reversal of 1406311300331 is 1330031136041.
It is not a de Polignac number, because 1406311300331 - 210 = 1406311299307 is a prime.
It is a super-2 number, since 2×14063113003312 (a number of 25 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 1406311300331.
It is not an unprimeable number, because it can be changed into a prime (1406311300333) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17966111 + ... + 18044216.
It is an arithmetic number, because the mean of its divisors is an integer number (136497148284).
Almost surely, 21406311300331 is an apocalyptic number.
1406311300331 is a deficient number, since it is larger than the sum of its proper divisors (231654479077).
1406311300331 is an equidigital number, since it uses as much as digits as its factorization.
1406311300331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36011138 (or 36011131 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 1406311300331 its reverse (1330031136041), we get a palindrome (2736342436372).
The spelling of 1406311300331 in words is "one trillion, four hundred six billion, three hundred eleven million, three hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •