Base | Representation |
---|---|
bin | 11001000010100110110001… |
… | …010000011001001010001011 |
3 | 112102221100101002211112202112 |
4 | 121002212301100121022023 |
5 | 103413333202424120243 |
6 | 1030121043535052535 |
7 | 32124434526023411 |
oct | 3102466120311213 |
9 | 472840332745675 |
10 | 110130230301323 |
11 | 320aaa71a090a1 |
12 | 10427b8737114b |
13 | 495b30baac45b |
14 | 1d2a48dc392b1 |
15 | caeb178b8818 |
hex | 6429b141928b |
110130230301323 has 2 divisors, whose sum is σ = 110130230301324. Its totient is φ = 110130230301322.
The previous prime is 110130230301319. The next prime is 110130230301331. The reversal of 110130230301323 is 323103032031011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110130230301323 - 22 = 110130230301319 is a prime.
It is not a weakly prime, because it can be changed into another prime (110130230301313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065115150661 + 55065115150662.
It is an arithmetic number, because the mean of its divisors is an integer number (55065115150662).
Almost surely, 2110130230301323 is an apocalyptic number.
110130230301323 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130230301323 is an equidigital number, since it uses as much as digits as its factorization.
110130230301323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 110130230301323 its reverse (323103032031011), we get a palindrome (433233262332334).
The spelling of 110130230301323 in words is "one hundred ten trillion, one hundred thirty billion, two hundred thirty million, three hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •