Base | Representation |
---|---|
bin | 1101010111101100010011… |
… | …0110111000001111010101 |
3 | 1221001101000201110221122122 |
4 | 3111323010312320033111 |
5 | 3411323443241314011 |
6 | 51133222144305325 |
7 | 3045042401061212 |
oct | 325730466701725 |
9 | 57041021427578 |
10 | 14700680807381 |
11 | 4758584084a08 |
12 | 1795110312245 |
13 | 82836447049a |
14 | 38b733d52b09 |
15 | 1a75e9b363db |
hex | d5ec4db83d5 |
14700680807381 has 4 divisors (see below), whose sum is σ = 14717254292832. Its totient is φ = 14684107321932.
The previous prime is 14700680807377. The next prime is 14700680807387. The reversal of 14700680807381 is 18370808600741.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14700680807381 - 22 = 14700680807377 is a prime.
It is a super-2 number, since 2×147006808073812 (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 (14700680807387) 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, 8286741395 + ... + 8286743168.
It is an arithmetic number, because the mean of its divisors is an integer number (3679313573208).
Almost surely, 214700680807381 is an apocalyptic number.
It is an amenable number.
14700680807381 is a deficient number, since it is larger than the sum of its proper divisors (16573485451).
14700680807381 is an equidigital number, since it uses as much as digits as its factorization.
14700680807381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16573485450.
The product of its (nonzero) digits is 1806336, while the sum is 53.
The spelling of 14700680807381 in words is "fourteen trillion, seven hundred billion, six hundred eighty million, eight hundred seven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •