Base | Representation |
---|---|
bin | 1010100110110010101101… |
… | …11001011111110011101111 |
3 | 10001120200002001110100001212 |
4 | 11103121112321133303233 |
5 | 11024111232331032401 |
6 | 121334255334025035 |
7 | 4625016624535655 |
oct | 523312671376357 |
9 | 101520061410055 |
10 | 23323130330351 |
11 | 7482314047605 |
12 | 27482191a817b |
13 | 1002491a04637 |
14 | 5a8bba1ccdd5 |
15 | 2a6a4c73edbb |
hex | 153656e5fcef |
23323130330351 has 2 divisors, whose sum is σ = 23323130330352. Its totient is φ = 23323130330350.
The previous prime is 23323130330323. The next prime is 23323130330363. The reversal of 23323130330351 is 15303303132332.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23323130330351 - 226 = 23323063221487 is a prime.
It is a super-3 number, since 3×233231303303513 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23323130333351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11661565165175 + 11661565165176.
It is an arithmetic number, because the mean of its divisors is an integer number (11661565165176).
Almost surely, 223323130330351 is an apocalyptic number.
23323130330351 is a deficient number, since it is larger than the sum of its proper divisors (1).
23323130330351 is an equidigital number, since it uses as much as digits as its factorization.
23323130330351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 32.
Adding to 23323130330351 its reverse (15303303132332), we get a palindrome (38626433462683).
The spelling of 23323130330351 in words is "twenty-three trillion, three hundred twenty-three billion, one hundred thirty million, three hundred thirty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •