Base | Representation |
---|---|
bin | 1010100011010111010010… |
… | …11101010011001010110101 |
3 | 10001011102000100112212010001 |
4 | 11101223221131103022311 |
5 | 11020144004001330023 |
6 | 121204214222231301 |
7 | 4613346466253530 |
oct | 521535135231265 |
9 | 101142010485101 |
10 | 23205330105013 |
11 | 7437363978781 |
12 | 2729422125531 |
13 | cc433a4a01a4 |
14 | 5a32030a5a17 |
15 | 2a395595e6ad |
hex | 151ae97532b5 |
23205330105013 has 4 divisors (see below), whose sum is σ = 26520377262880. Its totient is φ = 19890282947148.
The previous prime is 23205330105011. The next prime is 23205330105043. The reversal of 23205330105013 is 31050103350232.
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 23205330105013 - 21 = 23205330105011 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 (23205330105011) 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, 1657523578923 + ... + 1657523578936.
It is an arithmetic number, because the mean of its divisors is an integer number (6630094315720).
Almost surely, 223205330105013 is an apocalyptic number.
It is an amenable number.
23205330105013 is a deficient number, since it is larger than the sum of its proper divisors (3315047157867).
23205330105013 is an equidigital number, since it uses as much as digits as its factorization.
23205330105013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3315047157866.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 23205330105013 its reverse (31050103350232), we get a palindrome (54255433455245).
The spelling of 23205330105013 in words is "twenty-three trillion, two hundred five billion, three hundred thirty million, one hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •