Base | Representation |
---|---|
bin | 11011000100011000… |
… | …01000110110001101 |
3 | 1101111202222211201022 |
4 | 31202030020312031 |
5 | 214230224013041 |
6 | 10402004323525 |
7 | 1023060044531 |
oct | 154214106615 |
9 | 41452884638 |
10 | 14532251021 |
11 | 6188093312 |
12 | 29969a35a5 |
13 | 14a7976702 |
14 | 9bc065bc1 |
15 | 5a0c1c24b |
hex | 362308d8d |
14532251021 has 8 divisors (see below), whose sum is σ = 15048969984. Its totient is φ = 14018528160.
The previous prime is 14532251009. The next prime is 14532251033. The reversal of 14532251021 is 12015223541.
It is an interprime number because it is at equal distance from previous prime (14532251009) and next prime (14532251033).
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 14532251021 - 214 = 14532234637 is a prime.
It is a super-2 number, since 2×145322510212 (a number of 21 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 (14532251051) 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, 739151 + ... + 758556.
It is an arithmetic number, because the mean of its divisors is an integer number (1881121248).
Almost surely, 214532251021 is an apocalyptic number.
It is an amenable number.
14532251021 is a deficient number, since it is larger than the sum of its proper divisors (516718963).
14532251021 is a wasteful number, since it uses less digits than its factorization.
14532251021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1498051.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 14532251021 its reverse (12015223541), we get a palindrome (26547474562).
The spelling of 14532251021 in words is "fourteen billion, five hundred thirty-two million, two hundred fifty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •