Base | Representation |
---|---|
bin | 1010100001001011110001… |
… | …01001111101100101101101 |
3 | 10000220020122221220112100001 |
4 | 11100211320221331211231 |
5 | 11012432101311430203 |
6 | 121105545242304301 |
7 | 4605055306554364 |
oct | 520457051754555 |
9 | 100806587815301 |
10 | 23130423155053 |
11 | 7408614953565 |
12 | 27169b7ab8091 |
13 | cba260576266 |
14 | 59d7388d07db |
15 | 2a1a1e67791d |
hex | 150978a7d96d |
23130423155053 has 4 divisors (see below), whose sum is σ = 23130451532448. Its totient is φ = 23130394777660.
The previous prime is 23130423155029. The next prime is 23130423155093. The reversal of 23130423155053 is 35055132403132.
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 a cyclic number.
It is not a de Polignac number, because 23130423155053 - 29 = 23130423154541 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 (23130423155023) 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, 12928753 + ... + 14608678.
It is an arithmetic number, because the mean of its divisors is an integer number (5782612883112).
Almost surely, 223130423155053 is an apocalyptic number.
It is an amenable number.
23130423155053 is a deficient number, since it is larger than the sum of its proper divisors (28377395).
23130423155053 is an equidigital number, since it uses as much as digits as its factorization.
23130423155053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28377394.
The product of its (nonzero) digits is 162000, while the sum is 37.
Adding to 23130423155053 its reverse (35055132403132), we get a palindrome (58185555558185).
The spelling of 23130423155053 in words is "twenty-three trillion, one hundred thirty billion, four hundred twenty-three million, one hundred fifty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •