Base | Representation |
---|---|
bin | 11010000001000011010000… |
… | …110000110110100111110011 |
3 | 120000010120201021110021212211 |
4 | 122001003100300312213303 |
5 | 104444140042343424021 |
6 | 1043204251351432551 |
7 | 33046450506065620 |
oct | 3201032060664763 |
9 | 500116637407784 |
10 | 114421431233011 |
11 | 33504946a74781 |
12 | 109bb781985757 |
13 | 4bacb82778896 |
14 | 203805384b347 |
15 | d3656d7e63e1 |
hex | 6810d0c369f3 |
114421431233011 has 8 divisors (see below), whose sum is σ = 130772597876480. Its totient is φ = 98071576563528.
The previous prime is 114421431232981. The next prime is 114421431233017. The reversal of 114421431233011 is 110332134124411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114421431233011 - 27 = 114421431232883 is a prime.
It is a super-2 number, since 2×1144214312330112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114421431233017) 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, 327806601 + ... + 328155466.
It is an arithmetic number, because the mean of its divisors is an integer number (16346574734560).
Almost surely, 2114421431233011 is an apocalyptic number.
114421431233011 is a deficient number, since it is larger than the sum of its proper divisors (16351166643469).
114421431233011 is an equidigital number, since it uses as much as digits as its factorization.
114421431233011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655986993.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 114421431233011 its reverse (110332134124411), we get a palindrome (224753565357422).
The spelling of 114421431233011 in words is "one hundred fourteen trillion, four hundred twenty-one billion, four hundred thirty-one million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •