Base | Representation |
---|---|
bin | 1101000000011100111110… |
… | …1001111110000111101011 |
3 | 1212122012111020200020112112 |
4 | 3100013033221332013223 |
5 | 3333303312040430233 |
6 | 50225553010232535 |
7 | 3004146524244305 |
oct | 320071751760753 |
9 | 55565436606475 |
10 | 14301430014443 |
11 | 4614225450a00 |
12 | 172b867b8574b |
13 | 7c980810ca40 |
14 | 37629b496975 |
15 | 19c02ddd0048 |
hex | d01cfa7e1eb |
14301430014443 has 24 divisors (see below), whose sum is σ = 16943229659664. Its totient is φ = 11991087915840.
The previous prime is 14301430014439. The next prime is 14301430014491. The reversal of 14301430014443 is 34441003410341.
It is not a de Polignac number, because 14301430014443 - 22 = 14301430014439 is a prime.
It is a super-2 number, since 2×143014300144432 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14301430014433) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1962596 + ... + 5696897.
It is an arithmetic number, because the mean of its divisors is an integer number (705967902486).
Almost surely, 214301430014443 is an apocalyptic number.
14301430014443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14301430014443 is a deficient number, since it is larger than the sum of its proper divisors (2641799645221).
14301430014443 is a wasteful number, since it uses less digits than its factorization.
14301430014443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7660715 (or 7660704 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 14301430014443 its reverse (34441003410341), we get a palindrome (48742433424784).
The spelling of 14301430014443 in words is "fourteen trillion, three hundred one billion, four hundred thirty million, fourteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •