Base | Representation |
---|---|
bin | 1001000011101110110… |
… | …11101110110000011111 |
3 | 1002202100221121111020001 |
4 | 10201313123232300133 |
5 | 20044410244402143 |
6 | 354552103235131 |
7 | 31325565164266 |
oct | 4416733566037 |
9 | 1082327544201 |
10 | 311241403423 |
11 | 10aaa6727055 |
12 | 503a2148aa7 |
13 | 23471a78b02 |
14 | 110c80d15dd |
15 | 816953514d |
hex | 48776eec1f |
311241403423 has 6 divisors (see below), whose sum is σ = 322343951384. Its totient is φ = 300508940424.
The previous prime is 311241403411. The next prime is 311241403453. The reversal of 311241403423 is 324304142113.
It is a happy number.
It is not a de Polignac number, because 311241403423 - 229 = 310704532511 is a prime.
It is a super-2 number, since 2×3112414034232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 311241403391 and 311241403400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311241403453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 185041611 + ... + 185043292.
Almost surely, 2311241403423 is an apocalyptic number.
311241403423 is a deficient number, since it is larger than the sum of its proper divisors (11102547961).
311241403423 is an equidigital number, since it uses as much as digits as its factorization.
311241403423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370084961 (or 370084932 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 311241403423 its reverse (324304142113), we get a palindrome (635545545536).
The spelling of 311241403423 in words is "three hundred eleven billion, two hundred forty-one million, four hundred three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •