Base | Representation |
---|---|
bin | 1101000001100111001010… |
… | …0101100000100100100110 |
3 | 1212201002220001020001102110 |
4 | 3100121302211200210212 |
5 | 3334120102402301410 |
6 | 50243045003221450 |
7 | 3005453145236526 |
oct | 320316245404446 |
9 | 55632801201373 |
10 | 14321343400230 |
11 | 4621713aa1429 |
12 | 17336a4b17886 |
13 | 7cb65c87c859 |
14 | 37722a073686 |
15 | 19c7e723c720 |
hex | d0672960926 |
14321343400230 has 32 divisors (see below), whose sum is σ = 34371889256448. Its totient is φ = 3818951007200.
The previous prime is 14321343400187. The next prime is 14321343400249. The reversal of 14321343400230 is 3200434312341.
It is a happy number.
It is a super-2 number, since 2×143213434002302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3033606 + ... + 6151865.
It is an arithmetic number, because the mean of its divisors is an integer number (1074121539264).
Almost surely, 214321343400230 is an apocalyptic number.
14321343400230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14321343400230 is an abundant number, since it is smaller than the sum of its proper divisors (20050545856218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14321343400230 is a wasteful number, since it uses less digits than its factorization.
14321343400230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9237452.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 14321343400230 its reverse (3200434312341), we get a palindrome (17521777712571).
The spelling of 14321343400230 in words is "fourteen trillion, three hundred twenty-one billion, three hundred forty-three million, four hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •