Base | Representation |
---|---|
bin | 1101000001101110001001… |
… | …1100010010011101101100 |
3 | 1212201021201211102210100101 |
4 | 3100123202130102131230 |
5 | 3334132423312000330 |
6 | 50243555122040444 |
7 | 3005550513316333 |
oct | 320334234223554 |
9 | 55637654383311 |
10 | 14323220031340 |
11 | 4622497336130 |
12 | 1733b294a9124 |
13 | 7cb89b5c076c |
14 | 3773673b6d1a |
15 | 19c8a6d814ca |
hex | d06e271276c |
14323220031340 has 96 divisors (see below), whose sum is σ = 35013359485440. Its totient is φ = 4866721574400.
The previous prime is 14323220031221. The next prime is 14323220031361. The reversal of 14323220031340 is 4313002232341.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 14323220031299 and 14323220031308.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23164776 + ... + 23775055.
It is an arithmetic number, because the mean of its divisors is an integer number (364722494640).
Almost surely, 214323220031340 is an apocalyptic number.
14323220031340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14323220031340 is an abundant number, since it is smaller than the sum of its proper divisors (20690139454100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14323220031340 is a wasteful number, since it uses less digits than its factorization.
14323220031340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46939943 (or 46939941 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 14323220031340 its reverse (4313002232341), we get a palindrome (18636222263681).
The spelling of 14323220031340 in words is "fourteen trillion, three hundred twenty-three billion, two hundred twenty million, thirty-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •