Base | Representation |
---|---|
bin | 11010101011101000… |
… | …10111010010100100 |
3 | 1100222022102202110001 |
4 | 31111310113102210 |
5 | 213314110122012 |
6 | 10325231511044 |
7 | 1014656605552 |
oct | 152564272244 |
9 | 40868382401 |
10 | 14324692132 |
11 | 6090a08243 |
12 | 2939388484 |
13 | 14739739ba |
14 | 99c676bd2 |
15 | 58c8bd357 |
hex | 355d174a4 |
14324692132 has 12 divisors (see below), whose sum is σ = 25089961036. Its totient is φ = 7156131840.
The previous prime is 14324692111. The next prime is 14324692141. The reversal of 14324692132 is 23129642341.
14324692132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9671542336 + 4653149796 = 98344^2 + 68214^2 .
It is a super-3 number, since 3×143246921323 (a number of 31 digits) contains 333 as substring.
It is a hoax number, since the sum of its digits (37) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 14324692091 and 14324692100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1548369 + ... + 1557592.
Almost surely, 214324692132 is an apocalyptic number.
It is an amenable number.
14324692132 is a deficient number, since it is larger than the sum of its proper divisors (10765268904).
14324692132 is a wasteful number, since it uses less digits than its factorization.
14324692132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3107118 (or 3107116 counting only the distinct ones).
The product of its digits is 62208, while the sum is 37.
The spelling of 14324692132 in words is "fourteen billion, three hundred twenty-four million, six hundred ninety-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •