Base | Representation |
---|---|
bin | 1100111010101100001011… |
… | …0110110110101110101111 |
3 | 1212021201221211122021210102 |
4 | 3032223002312312232233 |
5 | 3330143034321243211 |
6 | 50112301242501315 |
7 | 2664043323662024 |
oct | 316530266665657 |
9 | 55251854567712 |
10 | 14202431040431 |
11 | 458624307a507 |
12 | 171463950483b |
13 | 7c038bb0948a |
14 | 37158936d54b |
15 | 1996879caa3b |
hex | ceac2db6baf |
14202431040431 has 16 divisors (see below), whose sum is σ = 15230753260800. Its totient is φ = 13203718564608.
The previous prime is 14202431040377. The next prime is 14202431040461. The reversal of 14202431040431 is 13404013420241.
It is not a de Polignac number, because 14202431040431 - 230 = 14201357298607 is a prime.
It is a super-2 number, since 2×142024310404312 (a number of 27 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 = 14202431040394 and 14202431040403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14202431040461) 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, 20875586 + ... + 21545183.
It is an arithmetic number, because the mean of its divisors is an integer number (951922078800).
Almost surely, 214202431040431 is an apocalyptic number.
14202431040431 is a deficient number, since it is larger than the sum of its proper divisors (1028322220369).
14202431040431 is a wasteful number, since it uses less digits than its factorization.
14202431040431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42421118.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 14202431040431 its reverse (13404013420241), we get a palindrome (27606444460672).
The spelling of 14202431040431 in words is "fourteen trillion, two hundred two billion, four hundred thirty-one million, forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •