Base | Representation |
---|---|
bin | 1010100111100101010101… |
… | …00001110011111011101001 |
3 | 10001200021012210000201002210 |
4 | 11103302222201303323221 |
5 | 11030032410110224431 |
6 | 121354551535115333 |
7 | 4630001165320026 |
oct | 523625241637351 |
9 | 101607183021083 |
10 | 23350303211241 |
11 | 7492898470166 |
12 | 2751541372b49 |
13 | 1004c02465896 |
14 | 5aa236d9454d |
15 | 2a75dd073d46 |
hex | 153caa873ee9 |
23350303211241 has 8 divisors (see below), whose sum is σ = 31134062609344. Its totient is φ = 15566706310320.
The previous prime is 23350303211201. The next prime is 23350303211267. The reversal of 23350303211241 is 14211230305332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23350303211241 - 226 = 23350236102377 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23350303211199 and 23350303211208.
It is not an unprimeable number, because it can be changed into a prime (23350303211201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40288606 + ... + 40864071.
It is an arithmetic number, because the mean of its divisors is an integer number (3891757826168).
Almost surely, 223350303211241 is an apocalyptic number.
It is an amenable number.
23350303211241 is a deficient number, since it is larger than the sum of its proper divisors (7783759398103).
23350303211241 is an equidigital number, since it uses as much as digits as its factorization.
23350303211241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81248591.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 23350303211241 its reverse (14211230305332), we get a palindrome (37561533516573).
The spelling of 23350303211241 in words is "twenty-three trillion, three hundred fifty billion, three hundred three million, two hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •