Base | Representation |
---|---|
bin | 1100111100010010111010… |
… | …1101110110001101110100 |
3 | 1212101101010220010001002221 |
4 | 3033010232231312031310 |
5 | 3331121030132002012 |
6 | 50133102044412124 |
7 | 2666040631601461 |
oct | 317045655661564 |
9 | 55341126101087 |
10 | 14230010422132 |
11 | 4596a059a914a |
12 | 1719a55847044 |
13 | 7c2b65846c4b |
14 | 372a4410c668 |
15 | 19a24dd59507 |
hex | cf12eb76374 |
14230010422132 has 36 divisors (see below), whose sum is σ = 26478475066764. Its totient is φ = 6690163440640.
The previous prime is 14230010422087. The next prime is 14230010422151. The reversal of 14230010422132 is 23122401003241.
It can be written as a sum of positive squares in 6 ways, for example, as 2584622120976 + 11645388301156 = 1607676^2 + 3412534^2 .
It is a super-2 number, since 2×142300104221322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14230010422097 and 14230010422106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4574473 + ... + 7027504.
It is an arithmetic number, because the mean of its divisors is an integer number (735513196299).
Almost surely, 214230010422132 is an apocalyptic number.
It is an amenable number.
14230010422132 is a deficient number, since it is larger than the sum of its proper divisors (12248464644632).
14230010422132 is a wasteful number, since it uses less digits than its factorization.
14230010422132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11603076 (or 11603057 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 14230010422132 its reverse (23122401003241), we get a palindrome (37352411425373).
The spelling of 14230010422132 in words is "fourteen trillion, two hundred thirty billion, ten million, four hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •