Base | Representation |
---|---|
bin | 11001111110010011000011… |
… | …001001000111001111100101 |
3 | 112222110111100002221121211020 |
4 | 121332103003021013033211 |
5 | 104433040043340304001 |
6 | 1042541320451201353 |
7 | 33030002001321432 |
oct | 3176230311071745 |
9 | 488414302847736 |
10 | 114232224150501 |
11 | 334416835611a6 |
12 | 1098ab788a6259 |
13 | 4b9808b4ba122 |
14 | 202cc24d32b89 |
15 | d31697b58736 |
hex | 67e4c32473e5 |
114232224150501 has 32 divisors (see below), whose sum is σ = 157089422439936. Its totient is φ = 73782527400000.
The previous prime is 114232224150493. The next prime is 114232224150553. The reversal of 114232224150501 is 105051422232411.
It is not a de Polignac number, because 114232224150501 - 23 = 114232224150493 is a prime.
It is a super-2 number, since 2×1142322241505012 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114232224150101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 109000086 + ... + 110043096.
It is an arithmetic number, because the mean of its divisors is an integer number (4909044451248).
Almost surely, 2114232224150501 is an apocalyptic number.
It is an amenable number.
114232224150501 is a deficient number, since it is larger than the sum of its proper divisors (42857198289435).
114232224150501 is a wasteful number, since it uses less digits than its factorization.
114232224150501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047233.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 114232224150501 its reverse (105051422232411), we get a palindrome (219283646382912).
The spelling of 114232224150501 in words is "one hundred fourteen trillion, two hundred thirty-two billion, two hundred twenty-four million, one hundred fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •