Base | Representation |
---|---|
bin | 1100101110111110110001… |
… | …1011010111100101100101 |
3 | 1211120111201020021101022011 |
4 | 3023233230123113211211 |
5 | 3313344042320441031 |
6 | 45440031540434221 |
7 | 2643362253661255 |
oct | 313575433274545 |
9 | 54514636241264 |
10 | 14001265015141 |
11 | 45089a30a8248 |
12 | 16a16573a8971 |
13 | 7a7410060011 |
14 | 365944483965 |
15 | 194311ecc6b1 |
hex | cbbec6d7965 |
14001265015141 has 4 divisors (see below), whose sum is σ = 14054501764512. Its totient is φ = 13948028265772.
The previous prime is 14001265015139. The next prime is 14001265015147. The reversal of 14001265015141 is 14151056210041.
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 14001265015141 - 21 = 14001265015139 is a prime.
It is a super-2 number, since 2×140012650151412 (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 (14001265015147) 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, 26618374291 + ... + 26618374816.
It is an arithmetic number, because the mean of its divisors is an integer number (3513625441128).
Almost surely, 214001265015141 is an apocalyptic number.
It is an amenable number.
14001265015141 is a deficient number, since it is larger than the sum of its proper divisors (53236749371).
14001265015141 is an equidigital number, since it uses as much as digits as its factorization.
14001265015141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53236749370.
The product of its (nonzero) digits is 4800, while the sum is 31.
The spelling of 14001265015141 in words is "fourteen trillion, one billion, two hundred sixty-five million, fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •