Base | Representation |
---|---|
bin | 11010101000110101… |
… | …10011011011110100 |
3 | 1100220200020222010100 |
4 | 31110122303123310 |
5 | 213242102330302 |
6 | 10323032354100 |
7 | 1014253213530 |
oct | 152432633364 |
9 | 40820228110 |
10 | 14301214452 |
11 | 60797320a8 |
12 | 2931545930 |
13 | 146bb43695 |
14 | 9994c4bc0 |
15 | 58a7d1d1c |
hex | 3546b36f4 |
14301214452 has 36 divisors (see below), whose sum is σ = 41314620256. Its totient is φ = 4086061200.
The previous prime is 14301214451. The next prime is 14301214457. The reversal of 14301214452 is 25441210341.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14301214451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28375174 + ... + 28375677.
Almost surely, 214301214452 is an apocalyptic number.
14301214452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14301214452 is an abundant number, since it is smaller than the sum of its proper divisors (27013405804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14301214452 is a wasteful number, since it uses less digits than its factorization.
14301214452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56750868 (or 56750863 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 14301214452 its reverse (25441210341), we get a palindrome (39742424793).
It can be divided in two parts, 143012 and 14452, that added together give a cube (157464 = 543).
The spelling of 14301214452 in words is "fourteen billion, three hundred one million, two hundred fourteen thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •