Base | Representation |
---|---|
bin | 1101000001100011110000… |
… | …1101110111110100011100 |
3 | 1212201000112110211020001022 |
4 | 3100120330031313310130 |
5 | 3334111220343444312 |
6 | 50242414300303312 |
7 | 3005421431040656 |
oct | 320307415676434 |
9 | 55630473736038 |
10 | 14320431234332 |
11 | 462129610a713 |
12 | 173348b541b38 |
13 | 7cb5458b6812 |
14 | 377180c6b6d6 |
15 | 19c79210b172 |
hex | d063c377d1c |
14320431234332 has 12 divisors (see below), whose sum is σ = 25060815404856. Its totient is φ = 7160198261520.
The previous prime is 14320431234299. The next prime is 14320431234337. The reversal of 14320431234332 is 23343213402341.
It is a junction number, because it is equal to n+sod(n) for n = 14320431234292 and 14320431234301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14320431234337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2384594 + ... + 5858937.
It is an arithmetic number, because the mean of its divisors is an integer number (2088401283738).
Almost surely, 214320431234332 is an apocalyptic number.
It is an amenable number.
14320431234332 is a deficient number, since it is larger than the sum of its proper divisors (10740384170524).
14320431234332 is a wasteful number, since it uses less digits than its factorization.
14320431234332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8677828 (or 8677826 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 14320431234332 its reverse (23343213402341), we get a palindrome (37663644636673).
The spelling of 14320431234332 in words is "fourteen trillion, three hundred twenty billion, four hundred thirty-one million, two hundred thirty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •