Base | Representation |
---|---|
bin | 1010100110011111111000… |
… | …11101100001001100100001 |
3 | 10001112200222122221102222022 |
4 | 11103033330131201030201 |
5 | 11023430032404040334 |
6 | 121325504401151225 |
7 | 4624211305565663 |
oct | 523177435411441 |
9 | 101480878842868 |
10 | 23313023111969 |
11 | 7478aa7860868 |
12 | 274627832b515 |
13 | 1001540a46c46 |
14 | 5a84dbb1a533 |
15 | 2a665a25382e |
hex | 1533fc761321 |
23313023111969 has 2 divisors, whose sum is σ = 23313023111970. Its totient is φ = 23313023111968.
The previous prime is 23313023111927. The next prime is 23313023112061. The reversal of 23313023111969 is 96911132031332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17332733827600 + 5980289284369 = 4163260^2 + 2445463^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23313023111969 is a prime.
It is a super-2 number, since 2×233130231119692 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23313023111669) 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, 11656511555984 + 11656511555985.
It is an arithmetic number, because the mean of its divisors is an integer number (11656511555985).
Almost surely, 223313023111969 is an apocalyptic number.
It is an amenable number.
23313023111969 is a deficient number, since it is larger than the sum of its proper divisors (1).
23313023111969 is an equidigital number, since it uses as much as digits as its factorization.
23313023111969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157464, while the sum is 44.
The spelling of 23313023111969 in words is "twenty-three trillion, three hundred thirteen billion, twenty-three million, one hundred eleven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •