Base | Representation |
---|---|
bin | 1101000001001101010101… |
… | …0101111111101100111111 |
3 | 1212200102222212110021011121 |
4 | 3100103111111333230333 |
5 | 3334011403021440411 |
6 | 50235541015531411 |
7 | 3005116301232415 |
oct | 320232525775477 |
9 | 55612885407147 |
10 | 14314410343231 |
11 | 4619786510059 |
12 | 173228b089b67 |
13 | 7caac63b4b6b |
14 | 376b6d3812b5 |
15 | 19c53d748571 |
hex | d04d557fb3f |
14314410343231 has 8 divisors (see below), whose sum is σ = 15301087621344. Its totient is φ = 13358092366080.
The previous prime is 14314410343217. The next prime is 14314410343237. The reversal of 14314410343231 is 13234301441341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14314410343231 - 215 = 14314410310463 is a prime.
It is a super-2 number, since 2×143144103432312 (a number of 27 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 (14314410343237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7589824266 + ... + 7589826151.
It is an arithmetic number, because the mean of its divisors is an integer number (1912635952668).
Almost surely, 214314410343231 is an apocalyptic number.
14314410343231 is a deficient number, since it is larger than the sum of its proper divisors (986677278113).
14314410343231 is a wasteful number, since it uses less digits than its factorization.
14314410343231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15179650481.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 14314410343231 its reverse (13234301441341), we get a palindrome (27548711784572).
The spelling of 14314410343231 in words is "fourteen trillion, three hundred fourteen billion, four hundred ten million, three hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •