Base | Representation |
---|---|
bin | 1101000010001000001010… |
… | …1000000010101001101001 |
3 | 1212201221202110001121022222 |
4 | 3100202002220002221221 |
5 | 3334241223310343103 |
6 | 50251112031123425 |
7 | 3006215526625004 |
oct | 320420250025151 |
9 | 55657673047288 |
10 | 14330202434153 |
11 | 462544a760771 |
12 | 1735357973575 |
13 | 7cc442074b68 |
14 | 37782a87253b |
15 | 19cb64d71638 |
hex | d0882a02a69 |
14330202434153 has 4 divisors (see below), whose sum is σ = 14443038673920. Its totient is φ = 14217366194388.
The previous prime is 14330202434143. The next prime is 14330202434173. The reversal of 14330202434153 is 35143420203341.
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 14330202434153 - 216 = 14330202368617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14330202434113) 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, 56418119693 + ... + 56418119946.
It is an arithmetic number, because the mean of its divisors is an integer number (3610759668480).
Almost surely, 214330202434153 is an apocalyptic number.
It is an amenable number.
14330202434153 is a deficient number, since it is larger than the sum of its proper divisors (112836239767).
14330202434153 is a wasteful number, since it uses less digits than its factorization.
14330202434153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112836239766.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 14330202434153 its reverse (35143420203341), we get a palindrome (49473622637494).
The spelling of 14330202434153 in words is "fourteen trillion, three hundred thirty billion, two hundred two million, four hundred thirty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •