Base | Representation |
---|---|
bin | 1010100001110000111000… |
… | …11010110100111110001011 |
3 | 10000222011002201202120022011 |
4 | 11100320130122310332023 |
5 | 11013243404213121303 |
6 | 121123042455040351 |
7 | 4606362160432024 |
oct | 520703432647613 |
9 | 100864081676264 |
10 | 23150350520203 |
11 | 7416010381985 |
12 | 271a8396700b7 |
13 | cbc0b7b9bc9a |
14 | 5a06a92a9c4b |
15 | 2a22d8d4716d |
hex | 150e1c6b4f8b |
23150350520203 has 2 divisors, whose sum is σ = 23150350520204. Its totient is φ = 23150350520202.
The previous prime is 23150350520201. The next prime is 23150350520221. The reversal of 23150350520203 is 30202505305132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23150350520203 - 21 = 23150350520201 is a prime.
It is a super-2 number, since 2×231503505202032 (a number of 28 digits) contains 22 as substring.
Together with 23150350520201, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (23150350520201) 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, 11575175260101 + 11575175260102.
It is an arithmetic number, because the mean of its divisors is an integer number (11575175260102).
Almost surely, 223150350520203 is an apocalyptic number.
23150350520203 is a deficient number, since it is larger than the sum of its proper divisors (1).
23150350520203 is an equidigital number, since it uses as much as digits as its factorization.
23150350520203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 31.
Adding to 23150350520203 its reverse (30202505305132), we get a palindrome (53352855825335).
The spelling of 23150350520203 in words is "twenty-three trillion, one hundred fifty billion, three hundred fifty million, five hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •