Base | Representation |
---|---|
bin | 11001111011000100011111… |
… | …010011110010010110111101 |
3 | 112221200021212001011202200001 |
4 | 121323010133103302112331 |
5 | 104420421331112344041 |
6 | 1042251400335034301 |
7 | 33004660535413165 |
oct | 3173043723622675 |
9 | 487607761152601 |
10 | 114010432153021 |
11 | 33366609782828 |
12 | 10953b9b06b991 |
13 | 4b801a34758b1 |
14 | 20221c49775a5 |
15 | d2aa16491131 |
hex | 67b11f4f25bd |
114010432153021 has 2 divisors, whose sum is σ = 114010432153022. Its totient is φ = 114010432153020.
The previous prime is 114010432153019. The next prime is 114010432153039. The reversal of 114010432153021 is 120351234010411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113893184805625 + 117247347396 = 10672075^2 + 342414^2 .
It is a cyclic number.
It is not a de Polignac number, because 114010432153021 - 21 = 114010432153019 is a prime.
Together with 114010432153019, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114010432153721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57005216076510 + 57005216076511.
It is an arithmetic number, because the mean of its divisors is an integer number (57005216076511).
Almost surely, 2114010432153021 is an apocalyptic number.
It is an amenable number.
114010432153021 is a deficient number, since it is larger than the sum of its proper divisors (1).
114010432153021 is an equidigital number, since it uses as much as digits as its factorization.
114010432153021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 114010432153021 its reverse (120351234010411), we get a palindrome (234361666163432).
The spelling of 114010432153021 in words is "one hundred fourteen trillion, ten billion, four hundred thirty-two million, one hundred fifty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •