Base | Representation |
---|---|
bin | 1101000000011111111101… |
… | …0111010100010111101101 |
3 | 1212122021120000210121221002 |
4 | 3100013333113110113231 |
5 | 3333311431442244323 |
6 | 50230204242050045 |
7 | 3004205413545014 |
oct | 320077727242755 |
9 | 55567500717832 |
10 | 14302230431213 |
11 | 46145a624696a |
12 | 172ba50049925 |
13 | 7c9904baa52a |
14 | 3763358cda7b |
15 | 19c0792da828 |
hex | d01ff5d45ed |
14302230431213 has 8 divisors (see below), whose sum is σ = 15016237819680. Its totient is φ = 13602944844720.
The previous prime is 14302230431171. The next prime is 14302230431221. The reversal of 14302230431213 is 31213403220341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14302230431213 - 212 = 14302230427117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14302230431113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3680448503 + ... + 3680452388.
It is an arithmetic number, because the mean of its divisors is an integer number (1877029727460).
Almost surely, 214302230431213 is an apocalyptic number.
It is an amenable number.
14302230431213 is a deficient number, since it is larger than the sum of its proper divisors (714007388467).
14302230431213 is an equidigital number, since it uses as much as digits as its factorization.
14302230431213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7360900987.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 14302230431213 its reverse (31213403220341), we get a palindrome (45515633651554).
The spelling of 14302230431213 in words is "fourteen trillion, three hundred two billion, two hundred thirty million, four hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •