Base | Representation |
---|---|
bin | 1010100001001110111101… |
… | …11111010101010010111101 |
3 | 10000220102002121111222102001 |
4 | 11100213132333111102331 |
5 | 11012444110322030323 |
6 | 121110431453102301 |
7 | 4605145665024151 |
oct | 520473677252275 |
9 | 100812077458361 |
10 | 23132140033213 |
11 | 7409315aa4532 |
12 | 27171b6a87991 |
13 | cba475181cb3 |
14 | 59d85c92b061 |
15 | 2a1ac02623ad |
hex | 1509defd54bd |
23132140033213 has 4 divisors (see below), whose sum is σ = 23184357054048. Its totient is φ = 23079923012380.
The previous prime is 23132140033181. The next prime is 23132140033229. The reversal of 23132140033213 is 31233004123132.
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 23132140033213 - 25 = 23132140033181 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 (23132140033273) 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, 26108509753 + ... + 26108510638.
It is an arithmetic number, because the mean of its divisors is an integer number (5796089263512).
Almost surely, 223132140033213 is an apocalyptic number.
It is an amenable number.
23132140033213 is a deficient number, since it is larger than the sum of its proper divisors (52217020835).
23132140033213 is an equidigital number, since it uses as much as digits as its factorization.
23132140033213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52217020834.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 23132140033213 its reverse (31233004123132), we get a palindrome (54365144156345).
The spelling of 23132140033213 in words is "twenty-three trillion, one hundred thirty-two billion, one hundred forty million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •