Base | Representation |
---|---|
bin | 1010100000100000011001… |
… | …11110000000010011101111 |
3 | 10000211000120102121200110020 |
4 | 11100100030332000103233 |
5 | 11012041411224231023 |
6 | 121051135130413223 |
7 | 4603302340105512 |
oct | 520201476002357 |
9 | 100730512550406 |
10 | 23107141633263 |
11 | 73a9758060666 |
12 | 271239ab91213 |
13 | cb7cc0088b6c |
14 | 59c56a87cd79 |
15 | 2a110a7a8de3 |
hex | 15040cf804ef |
23107141633263 has 8 divisors (see below), whose sum is σ = 32149066620288. Its totient is φ = 14734988867544.
The previous prime is 23107141633249. The next prime is 23107141633267. The reversal of 23107141633263 is 36233614170132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23107141633263 - 220 = 23107140584687 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23107141633267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167443055245 + ... + 167443055382.
It is an arithmetic number, because the mean of its divisors is an integer number (4018633327536).
Almost surely, 223107141633263 is an apocalyptic number.
23107141633263 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
23107141633263 is a deficient number, since it is larger than the sum of its proper divisors (9041924987025).
23107141633263 is a wasteful number, since it uses less digits than its factorization.
23107141633263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334886110653.
The product of its (nonzero) digits is 326592, while the sum is 42.
The spelling of 23107141633263 in words is "twenty-three trillion, one hundred seven billion, one hundred forty-one million, six hundred thirty-three thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •