Base | Representation |
---|---|
bin | 1100110110101011011110… |
… | …0101101000101110110011 |
3 | 1212001011002111001202200222 |
4 | 3031222313211220232303 |
5 | 3323030423230004111 |
6 | 50020503421403255 |
7 | 2656053602026550 |
oct | 315526745505663 |
9 | 55034074052628 |
10 | 14133522500531 |
11 | 4559aa1a9a585 |
12 | 170320810952b |
13 | 7b6a29842705 |
14 | 36c0cd6b1a27 |
15 | 1979a31157db |
hex | cdab7968bb3 |
14133522500531 has 8 divisors (see below), whose sum is σ = 16155355018080. Its totient is φ = 12112379451648.
The previous prime is 14133522500521. The next prime is 14133522500597. The reversal of 14133522500531 is 13500522533141.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14133522500531 - 210 = 14133522499507 is a prime.
It is a super-2 number, since 2×141335225005312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14133522500491 and 14133522500500.
It is not an unprimeable number, because it can be changed into a prime (14133522500501) 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, 172323236 + ... + 172405233.
It is an arithmetic number, because the mean of its divisors is an integer number (2019419377260).
Almost surely, 214133522500531 is an apocalyptic number.
14133522500531 is a deficient number, since it is larger than the sum of its proper divisors (2021832517549).
14133522500531 is an equidigital number, since it uses as much as digits as its factorization.
14133522500531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344734333.
The product of its (nonzero) digits is 54000, while the sum is 35.
The spelling of 14133522500531 in words is "fourteen trillion, one hundred thirty-three billion, five hundred twenty-two million, five hundred thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •