Base | Representation |
---|---|
bin | 1100101111100111101000… |
… | …1100011110111010001001 |
3 | 1211121120000122020200111111 |
4 | 3023321322030132322021 |
5 | 3314034023223142413 |
6 | 45445044155330321 |
7 | 2644231130551330 |
oct | 313717214367211 |
9 | 54546018220444 |
10 | 14012233412233 |
11 | 4512611510331 |
12 | 16a37b87509a1 |
13 | 7a846a570c04 |
14 | 3662a5088d17 |
15 | 194754dc7d3d |
hex | cbe7a31ee89 |
14012233412233 has 8 divisors (see below), whose sum is σ = 16955979927552. Its totient is φ = 11303986618176.
The previous prime is 14012233412209. The next prime is 14012233412251. The reversal of 14012233412233 is 33221433221041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14012233412233 - 213 = 14012233404041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14012233412195 and 14012233412204.
It is not an unprimeable number, because it can be changed into a prime (14012233812233) 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, 58874930185 + ... + 58874930422.
It is an arithmetic number, because the mean of its divisors is an integer number (2119497490944).
Almost surely, 214012233412233 is an apocalyptic number.
It is an amenable number.
14012233412233 is a deficient number, since it is larger than the sum of its proper divisors (2943746515319).
14012233412233 is a wasteful number, since it uses less digits than its factorization.
14012233412233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117749860631.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 14012233412233 its reverse (33221433221041), we get a palindrome (47233666633274).
The spelling of 14012233412233 in words is "fourteen trillion, twelve billion, two hundred thirty-three million, four hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •