Base | Representation |
---|---|
bin | 1100110101100011100110… |
… | …1010100101111010011110 |
3 | 1211222022021221211021001210 |
4 | 3031120321222211322132 |
5 | 3322221420340020220 |
6 | 50003553204245250 |
7 | 2654501530344255 |
oct | 315307152457236 |
9 | 54868257737053 |
10 | 14114230001310 |
11 | 45518a197334a |
12 | 16bb5230a0826 |
13 | 7b4c739022ba |
14 | 36b1bd35779c |
15 | 19722454e6e0 |
hex | cd639aa5e9e |
14114230001310 has 64 divisors (see below), whose sum is σ = 35460597519360. Its totient is φ = 3588575316480.
The previous prime is 14114230001237. The next prime is 14114230001323. The reversal of 14114230001310 is 1310003241141.
It is a super-2 number, since 2×141142300013102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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, 32671915 + ... + 33101094.
It is an arithmetic number, because the mean of its divisors is an integer number (554071836240).
Almost surely, 214114230001310 is an apocalyptic number.
14114230001310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14114230001310 is an abundant number, since it is smaller than the sum of its proper divisors (21346367518050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14114230001310 is a wasteful number, since it uses less digits than its factorization.
14114230001310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65773353.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 14114230001310 its reverse (1310003241141), we get a palindrome (15424233242451).
The spelling of 14114230001310 in words is "fourteen trillion, one hundred fourteen billion, two hundred thirty million, one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •