Base | Representation |
---|---|
bin | 11011000100010111… |
… | …01110111110001011 |
3 | 1101111202210110022220 |
4 | 31202023232332023 |
5 | 214230212120120 |
6 | 10402002145123 |
7 | 1023056123532 |
oct | 154213567613 |
9 | 41452713286 |
10 | 14532145035 |
11 | 6188020721 |
12 | 29969521a3 |
13 | 14a793a3b5 |
14 | 9bc039319 |
15 | 5a0beab40 |
hex | 3622eef8b |
14532145035 has 8 divisors (see below), whose sum is σ = 23251432080. Its totient is φ = 7750477344.
The previous prime is 14532145031. The next prime is 14532145087. The reversal of 14532145035 is 53054123541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14532145035 - 22 = 14532145031 is a prime.
It is a super-2 number, since 2×145321450352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14532144987 and 14532145005.
It is not an unprimeable number, because it can be changed into a prime (14532145031) 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, 484404820 + ... + 484404849.
It is an arithmetic number, because the mean of its divisors is an integer number (2906429010).
Almost surely, 214532145035 is an apocalyptic number.
14532145035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14532145035 is a deficient number, since it is larger than the sum of its proper divisors (8719287045).
14532145035 is an equidigital number, since it uses as much as digits as its factorization.
14532145035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 968809677.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 14532145035 its reverse (53054123541), we get a palindrome (67586268576).
The spelling of 14532145035 in words is "fourteen billion, five hundred thirty-two million, one hundred forty-five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •