Base | Representation |
---|---|
bin | 100011010010100111000110… |
… | …1110011100001101010101111 |
3 | 1111201002222020000011110121101 |
4 | 1012211032031303201222233 |
5 | 311141414443421204403 |
6 | 3020113300405543531 |
7 | 122246121145444006 |
oct | 10645161563415257 |
9 | 1451088200143541 |
10 | 310421140413103 |
11 | 8aa00959112125 |
12 | 2a995843a14ba7 |
13 | 10429784906845 |
14 | 569266b66bc3d |
15 | 25d4b760d171d |
hex | 11a538dce1aaf |
310421140413103 has 32 divisors (see below), whose sum is σ = 314104723637760. Its totient is φ = 306765728133120.
The previous prime is 310421140413089. The next prime is 310421140413149. The reversal of 310421140413103 is 301314041124013.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-310421140413103 is a prime.
It is a super-2 number, since 2×3104211404131032 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (310421140413203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50714118883 + ... + 50714125003.
It is an arithmetic number, because the mean of its divisors is an integer number (9815772613680).
Almost surely, 2310421140413103 is an apocalyptic number.
310421140413103 is a deficient number, since it is larger than the sum of its proper divisors (3683583224657).
310421140413103 is a wasteful number, since it uses less digits than its factorization.
310421140413103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9007.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 310421140413103 its reverse (301314041124013), we get a palindrome (611735181537116).
The spelling of 310421140413103 in words is "three hundred ten trillion, four hundred twenty-one billion, one hundred forty million, four hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •