Base | Representation |
---|---|
bin | 1100110000101110010110… |
… | …0110110011111011000111 |
3 | 1211200101000112002210112102 |
4 | 3030023211212303323013 |
5 | 3314341412112022401 |
6 | 45501503520142315 |
7 | 2645502411406241 |
oct | 314134546637307 |
9 | 54611015083472 |
10 | 14031215345351 |
11 | 451a6722a6666 |
12 | 16a741576799b |
13 | 7aa1a40540b9 |
14 | 36718607d091 |
15 | 194eb659456b |
hex | cc2e59b3ec7 |
14031215345351 has 4 divisors (see below), whose sum is σ = 14031344775000. Its totient is φ = 14031085915704.
The previous prime is 14031215345263. The next prime is 14031215345383. The reversal of 14031215345351 is 15354351213041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14031215345351 - 226 = 14031148236487 is a prime.
It is a super-2 number, since 2×140312153453512 (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 (14031215345951) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64552076 + ... + 64769073.
It is an arithmetic number, because the mean of its divisors is an integer number (3507836193750).
Almost surely, 214031215345351 is an apocalyptic number.
14031215345351 is a deficient number, since it is larger than the sum of its proper divisors (129429649).
14031215345351 is a wasteful number, since it uses less digits than its factorization.
14031215345351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129429648.
The product of its (nonzero) digits is 108000, while the sum is 38.
Adding to 14031215345351 its reverse (15354351213041), we get a palindrome (29385566558392).
The spelling of 14031215345351 in words is "fourteen trillion, thirty-one billion, two hundred fifteen million, three hundred forty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •