Base | Representation |
---|---|
bin | 1101000001001010111100… |
… | …0000001010010111000111 |
3 | 1212200101100001001101110121 |
4 | 3100102233000022113013 |
5 | 3334004043333214021 |
6 | 50235353120402411 |
7 | 3005064330516445 |
oct | 320225700122707 |
9 | 55611301041417 |
10 | 14313767085511 |
11 | 46194863a7003 |
12 | 173212b776407 |
13 | 7caa230519aa |
14 | 376b0bb77b95 |
15 | 19c502033741 |
hex | d04af00a5c7 |
14313767085511 has 8 divisors (see below), whose sum is σ = 14414709938544. Its totient is φ = 14212984334400.
The previous prime is 14313767085491. The next prime is 14313767085577. The reversal of 14313767085511 is 11558076731341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14313767085511 - 29 = 14313767084999 is a prime.
It is a super-2 number, since 2×143137670855112 (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 (14313767085311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39846040 + ... + 40203661.
It is an arithmetic number, because the mean of its divisors is an integer number (1801838742318).
Almost surely, 214313767085511 is an apocalyptic number.
14313767085511 is a deficient number, since it is larger than the sum of its proper divisors (100942853033).
14313767085511 is a wasteful number, since it uses less digits than its factorization.
14313767085511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80050961.
The product of its (nonzero) digits is 2116800, while the sum is 52.
The spelling of 14313767085511 in words is "fourteen trillion, three hundred thirteen billion, seven hundred sixty-seven million, eighty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •