Base | Representation |
---|---|
bin | 1101000110110010001110… |
… | …0100010110110000010111 |
3 | 1220000121021110012020100010 |
4 | 3101230203210112300113 |
5 | 3342044103233323111 |
6 | 50351543210051303 |
7 | 3015050326044354 |
oct | 321544344266027 |
9 | 56017243166303 |
10 | 14410212011031 |
11 | 4656378009021 |
12 | 1748966a19b33 |
13 | 806b53180a65 |
14 | 37b65a9c162b |
15 | 19ec990d2aa6 |
hex | d1b23916c17 |
14410212011031 has 16 divisors (see below), whose sum is σ = 19247353972704. Its totient is φ = 9589939789824.
The previous prime is 14410212011017. The next prime is 14410212011051. The reversal of 14410212011031 is 13011021201441.
It is not a de Polignac number, because 14410212011031 - 215 = 14410211978263 is a prime.
It is a super-3 number, since 3×144102120110313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 14410212010989 and 14410212011007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14410212011051) 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, 119054815 + ... + 119175791.
It is an arithmetic number, because the mean of its divisors is an integer number (1202959623294).
Almost surely, 214410212011031 is an apocalyptic number.
14410212011031 is a deficient number, since it is larger than the sum of its proper divisors (4837141961673).
14410212011031 is a wasteful number, since it uses less digits than its factorization.
14410212011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190370.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 14410212011031 its reverse (13011021201441), we get a palindrome (27421233212472).
The spelling of 14410212011031 in words is "fourteen trillion, four hundred ten billion, two hundred twelve million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •