Base | Representation |
---|---|
bin | 11001000001000010111010… |
… | …011111100111001001011001 |
3 | 112102120002121210222221121001 |
4 | 121001002322133213021121 |
5 | 103410104111320301241 |
6 | 1025555512403345001 |
7 | 32113620531622411 |
oct | 3101027237471131 |
9 | 472502553887531 |
10 | 110023011103321 |
11 | 32069551523758 |
12 | 1040b243982161 |
13 | 495118274a424 |
14 | 1d251dc0bd641 |
15 | cabe3e9b7431 |
hex | 6410ba7e7259 |
110023011103321 has 2 divisors, whose sum is σ = 110023011103322. Its totient is φ = 110023011103320.
The previous prime is 110023011103289. The next prime is 110023011103337. The reversal of 110023011103321 is 123301110320011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103420865856025 + 6602145247296 = 10169605^2 + 2569464^2 .
It is a cyclic number.
It is not a de Polignac number, because 110023011103321 - 25 = 110023011103289 is a prime.
It is not a weakly prime, because it can be changed into another prime (110023011103391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55011505551660 + 55011505551661.
It is an arithmetic number, because the mean of its divisors is an integer number (55011505551661).
Almost surely, 2110023011103321 is an apocalyptic number.
It is an amenable number.
110023011103321 is a deficient number, since it is larger than the sum of its proper divisors (1).
110023011103321 is an equidigital number, since it uses as much as digits as its factorization.
110023011103321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110023011103321 its reverse (123301110320011), we get a palindrome (233324121423332).
The spelling of 110023011103321 in words is "one hundred ten trillion, twenty-three billion, eleven million, one hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •