Base | Representation |
---|---|
bin | 1010100000100101101111… |
… | …11101001001001100001001 |
3 | 10000211021222100112122002212 |
4 | 11100102313331021030021 |
5 | 11012113300114431213 |
6 | 121052331524234505 |
7 | 4603433412343643 |
oct | 520226775111411 |
9 | 100737870478085 |
10 | 23110010311433 |
11 | 73aa99a386a71 |
12 | 2712a5b83ba35 |
13 | cb83594b1076 |
14 | 59c75d85d893 |
15 | 2a122755c9a8 |
hex | 1504b7f49309 |
23110010311433 has 2 divisors, whose sum is σ = 23110010311434. Its totient is φ = 23110010311432.
The previous prime is 23110010311429. The next prime is 23110010311459. The reversal of 23110010311433 is 33411301001132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11571678548089 + 11538331763344 = 3401717^2 + 3396812^2 .
It is a cyclic number.
It is not a de Polignac number, because 23110010311433 - 22 = 23110010311429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23110010311399 and 23110010311408.
It is not a weakly prime, because it can be changed into another prime (23110010310433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11555005155716 + 11555005155717.
It is an arithmetic number, because the mean of its divisors is an integer number (11555005155717).
Almost surely, 223110010311433 is an apocalyptic number.
It is an amenable number.
23110010311433 is a deficient number, since it is larger than the sum of its proper divisors (1).
23110010311433 is an equidigital number, since it uses as much as digits as its factorization.
23110010311433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 23110010311433 its reverse (33411301001132), we get a palindrome (56521311312565).
The spelling of 23110010311433 in words is "twenty-three trillion, one hundred ten billion, ten million, three hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •