Base | Representation |
---|---|
bin | 1101000000111110100000… |
… | …1010111011110001000011 |
3 | 1212200001201120002001021020 |
4 | 3100033220022323301003 |
5 | 3333430230344241311 |
6 | 50234042114000523 |
7 | 3004615553364156 |
oct | 320175012736103 |
9 | 55601646061236 |
10 | 14310431243331 |
11 | 4618024401443 |
12 | 173155a576143 |
13 | 7ca610c00492 |
14 | 3768b2b0bc9d |
15 | 19c3a9250c06 |
hex | d03e82bbc43 |
14310431243331 has 16 divisors (see below), whose sum is σ = 19933379558400. Its totient is φ = 9121300904160.
The previous prime is 14310431243299. The next prime is 14310431243347. The reversal of 14310431243331 is 13334213401341.
It is not a de Polignac number, because 14310431243331 - 25 = 14310431243299 is a prime.
It is a super-2 number, since 2×143104312433312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14310431243292 and 14310431243301.
It is not an unprimeable number, because it can be changed into a prime (14310431247331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 926953756 + ... + 926969193.
It is an arithmetic number, because the mean of its divisors is an integer number (1245836222400).
Almost surely, 214310431243331 is an apocalyptic number.
14310431243331 is a deficient number, since it is larger than the sum of its proper divisors (5622948315069).
14310431243331 is a wasteful number, since it uses less digits than its factorization.
14310431243331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1853923066.
The product of its (nonzero) digits is 31104, while the sum is 33.
Adding to 14310431243331 its reverse (13334213401341), we get a palindrome (27644644644672).
The spelling of 14310431243331 in words is "fourteen trillion, three hundred ten billion, four hundred thirty-one million, two hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •