Base | Representation |
---|---|
bin | 1100110111010110110011… |
… | …1000110000000111111000 |
3 | 1212002021010010000101000201 |
4 | 3031311230320300013320 |
5 | 3323223233423402412 |
6 | 50030105531411544 |
7 | 2656645051133230 |
oct | 315655470600770 |
9 | 55067103011021 |
10 | 14145154122232 |
11 | 4563a20814081 |
12 | 17055135b3bb4 |
13 | 7b7b61587ac3 |
14 | 36c8b43dacc0 |
15 | 197e3436be57 |
hex | cdd6ce301f8 |
14145154122232 has 32 divisors (see below), whose sum is σ = 30579283893600. Its totient is φ = 6008561040384.
The previous prime is 14145154122217. The next prime is 14145154122283. The reversal of 14145154122232 is 23222145154141.
It is a junction number, because it is equal to n+sod(n) for n = 14145154122191 and 14145154122200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1117657557 + ... + 1117670212.
It is an arithmetic number, because the mean of its divisors is an integer number (955602621675).
Almost surely, 214145154122232 is an apocalyptic number.
It is an amenable number.
14145154122232 is an abundant number, since it is smaller than the sum of its proper divisors (16434129771368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14145154122232 is a wasteful number, since it uses less digits than its factorization.
14145154122232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2235327895 (or 2235327891 counting only the distinct ones).
The product of its digits is 76800, while the sum is 37.
Adding to 14145154122232 its reverse (23222145154141), we get a palindrome (37367299276373).
The spelling of 14145154122232 in words is "fourteen trillion, one hundred forty-five billion, one hundred fifty-four million, one hundred twenty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •