Base | Representation |
---|---|
bin | 1010100000111010010011… |
… | …01101000101111111011101 |
3 | 10000212100110102012220122210 |
4 | 11100131021231011333131 |
5 | 11012303400122342112 |
6 | 121101354531031033 |
7 | 4604304030115545 |
oct | 520351155057735 |
9 | 100770412186583 |
10 | 23121045512157 |
11 | 740464247766a |
12 | 271501b43b479 |
13 | cb93c77b1938 |
14 | 59d0c9294325 |
15 | 2a1671251b3c |
hex | 150749b45fdd |
23121045512157 has 4 divisors (see below), whose sum is σ = 30828060682880. Its totient is φ = 15414030341436.
The previous prime is 23121045512129. The next prime is 23121045512171. The reversal of 23121045512157 is 75121554012132.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 23121045512157 - 223 = 23121037123549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23121045512107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3853507585357 + ... + 3853507585362.
It is an arithmetic number, because the mean of its divisors is an integer number (7707015170720).
Almost surely, 223121045512157 is an apocalyptic number.
It is an amenable number.
23121045512157 is a deficient number, since it is larger than the sum of its proper divisors (7707015170723).
23121045512157 is an equidigital number, since it uses as much as digits as its factorization.
23121045512157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7707015170722.
The product of its (nonzero) digits is 84000, while the sum is 39.
Adding to 23121045512157 its reverse (75121554012132), we get a palindrome (98242599524289).
The spelling of 23121045512157 in words is "twenty-three trillion, one hundred twenty-one billion, forty-five million, five hundred twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •