Base | Representation |
---|---|
bin | 11001111011100001001010… |
… | …011010100001110000111111 |
3 | 112221210020022201011002202200 |
4 | 121323201022122201300333 |
5 | 104421422404322031143 |
6 | 1042313451355522543 |
7 | 33010130513633643 |
oct | 3173411232416077 |
9 | 487706281132680 |
10 | 114041220111423 |
11 | 33378678782650 |
12 | 10959b51a59453 |
13 | 4b8306bb65967 |
14 | 20238a58d4c23 |
15 | d2b7193641d3 |
hex | 67b84a6a1c3f |
114041220111423 has 24 divisors (see below), whose sum is σ = 179770672912896. Its totient is φ = 69089215448400.
The previous prime is 114041220111407. The next prime is 114041220111517. The reversal of 114041220111423 is 324111022140411.
114041220111423 is a `hidden beast` number, since 1 + 1 + 4 + 0 + 4 + 1 + 220 + 1 + 11 + 423 = 666.
It is not a de Polignac number, because 114041220111423 - 24 = 114041220111407 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114041220111823) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 222038265 + ... + 222551282.
It is an arithmetic number, because the mean of its divisors is an integer number (7490444704704).
Almost surely, 2114041220111423 is an apocalyptic number.
114041220111423 is a deficient number, since it is larger than the sum of its proper divisors (65729452801473).
114041220111423 is a wasteful number, since it uses less digits than its factorization.
114041220111423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444592155 (or 444592152 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 114041220111423 its reverse (324111022140411), we get a palindrome (438152242251834).
The spelling of 114041220111423 in words is "one hundred fourteen trillion, forty-one billion, two hundred twenty million, one hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •