Base | Representation |
---|---|
bin | 1010011110111110001010… |
… | …11110010000010001001101 |
3 | 10000121222102221200011000020 |
4 | 11033133011132100101031 |
5 | 11010210404021121031 |
6 | 121011014000252353 |
7 | 4566424405044306 |
oct | 517370536202115 |
9 | 100558387604006 |
10 | 23054402520141 |
11 | 7389354217363 |
12 | 27041209110b9 |
13 | cb30369b9755 |
14 | 599ba64577ad |
15 | 29ea70705096 |
hex | 14f7c579044d |
23054402520141 has 8 divisors (see below), whose sum is σ = 30774015598560. Its totient is φ = 15352195560912.
The previous prime is 23054402520077. The next prime is 23054402520197. The reversal of 23054402520141 is 14102520445032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23054402520141 - 26 = 23054402520077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23054402522141) 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 in 7 ways as a sum of consecutive naturals, for example, 4351526706 + ... + 4351532003.
It is an arithmetic number, because the mean of its divisors is an integer number (3846751949820).
Almost surely, 223054402520141 is an apocalyptic number.
It is an amenable number.
23054402520141 is a deficient number, since it is larger than the sum of its proper divisors (7719613078419).
23054402520141 is an equidigital number, since it uses as much as digits as its factorization.
23054402520141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8703059595.
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 23054402520141 its reverse (14102520445032), we get a palindrome (37156922965173).
The spelling of 23054402520141 in words is "twenty-three trillion, fifty-four billion, four hundred two million, five hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.447 sec. • engine limits •