Base | Representation |
---|---|
bin | 1010011110101001010011… |
… | …10001001011011001001101 |
3 | 10000120220112020201102201222 |
4 | 11033110221301023121031 |
5 | 11010014433234104441 |
6 | 121001522230013125 |
7 | 4565546661541214 |
oct | 517245161133115 |
9 | 100526466642658 |
10 | 23043200300621 |
11 | 738462591aaa6 |
12 | 2701b151a71a5 |
13 | cb1c6cc0b7a7 |
14 | 59942278807b |
15 | 29e61701dd4b |
hex | 14f529c4b64d |
23043200300621 has 2 divisors, whose sum is σ = 23043200300622. Its totient is φ = 23043200300620.
The previous prime is 23043200300453. The next prime is 23043200300629. The reversal of 23043200300621 is 12600300234032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12039477342025 + 11003722958596 = 3469795^2 + 3317186^2 .
It is a cyclic number.
It is not a de Polignac number, because 23043200300621 - 242 = 18645153789517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23043200300629) 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, 11521600150310 + 11521600150311.
It is an arithmetic number, because the mean of its divisors is an integer number (11521600150311).
Almost surely, 223043200300621 is an apocalyptic number.
It is an amenable number.
23043200300621 is a deficient number, since it is larger than the sum of its proper divisors (1).
23043200300621 is an equidigital number, since it uses as much as digits as its factorization.
23043200300621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 23043200300621 its reverse (12600300234032), we get a palindrome (35643500534653).
The spelling of 23043200300621 in words is "twenty-three trillion, forty-three billion, two hundred million, three hundred thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •