Base | Representation |
---|---|
bin | 1100110001011011110111… |
… | …0001101001111000000111 |
3 | 1211201112112220220012121022 |
4 | 3030112331301221320013 |
5 | 3320041422043013111 |
6 | 45511244045341355 |
7 | 2646414223310216 |
oct | 314267561517007 |
9 | 54645486805538 |
10 | 14043432001031 |
11 | 4524871286914 |
12 | 16a9864b6785b |
13 | 7ab3a0055044 |
14 | 3679c477707d |
15 | 19547dd5e2db |
hex | cc5bdc69e07 |
14043432001031 has 8 divisors (see below), whose sum is σ = 14045261018064. Its totient is φ = 14041603134720.
The previous prime is 14043432001019. The next prime is 14043432001033. The reversal of 14043432001031 is 13010023434041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14043432001031 is a prime.
It is a super-2 number, since 2×140434320010312 (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 (14043432001033) 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, 467927816 + ... + 467957826.
It is an arithmetic number, because the mean of its divisors is an integer number (1755657627258).
Almost surely, 214043432001031 is an apocalyptic number.
14043432001031 is a deficient number, since it is larger than the sum of its proper divisors (1829017033).
14043432001031 is a wasteful number, since it uses less digits than its factorization.
14043432001031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75361.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 14043432001031 its reverse (13010023434041), we get a palindrome (27053455435072).
The spelling of 14043432001031 in words is "fourteen trillion, forty-three billion, four hundred thirty-two million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •