Base | Representation |
---|---|
bin | 1100101110111111001110… |
… | …1111100100001010001111 |
3 | 1211120112000210012221220211 |
4 | 3023233303233210022033 |
5 | 3313344320231000111 |
6 | 45440052043223251 |
7 | 2643365304133033 |
oct | 313576357441217 |
9 | 54515023187824 |
10 | 14001387750031 |
11 | 4508a56407840 |
12 | 16a1690517b27 |
13 | 7a742c603a06 |
14 | 3659568b21c3 |
15 | 19431cb73521 |
hex | cbbf3be428f |
14001387750031 has 8 divisors (see below), whose sum is σ = 15800939154000. Its totient is φ = 12289619341440.
The previous prime is 14001387750029. The next prime is 14001387750071. The reversal of 14001387750031 is 13005778310041.
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 14001387750031 - 21 = 14001387750029 is a prime.
It is a super-2 number, since 2×140013877500312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14001387750001) 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, 21945748506 + ... + 21945749143.
It is an arithmetic number, because the mean of its divisors is an integer number (1975117394250).
Almost surely, 214001387750031 is an apocalyptic number.
14001387750031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14001387750031 is a deficient number, since it is larger than the sum of its proper divisors (1799551403969).
14001387750031 is a wasteful number, since it uses less digits than its factorization.
14001387750031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43891497689.
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 14001387750031 in words is "fourteen trillion, one billion, three hundred eighty-seven million, seven hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •