Base | Representation |
---|---|
bin | 11010101011011110… |
… | …00101111010011000 |
3 | 1100222012211112211120 |
4 | 31111233011322120 |
5 | 213313231411412 |
6 | 10325142125240 |
7 | 1014642061650 |
oct | 152557057230 |
9 | 40865745746 |
10 | 14323310232 |
11 | 6090153a80 |
12 | 2938a20820 |
13 | 14735ab9ca |
14 | 99c3d7360 |
15 | 58c6e8b8c |
hex | 355bc5e98 |
14323310232 has 64 divisors (see below), whose sum is σ = 44644089600. Its totient is φ = 3720339840.
The previous prime is 14323310201. The next prime is 14323310233. The reversal of 14323310232 is 23201332341.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14323310233) 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 15 ways as a sum of consecutive naturals, for example, 3873507 + ... + 3877202.
It is an arithmetic number, because the mean of its divisors is an integer number (697563900).
Almost surely, 214323310232 is an apocalyptic number.
14323310232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14323310232 is an abundant number, since it is smaller than the sum of its proper divisors (30320779368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14323310232 is a wasteful number, since it uses less digits than its factorization.
14323310232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7750736 (or 7750732 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 14323310232 its reverse (23201332341), we get a palindrome (37524642573).
The spelling of 14323310232 in words is "fourteen billion, three hundred twenty-three million, three hundred ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •