Base | Representation |
---|---|
bin | 1010011110011010010100… |
… | …00011110011111100000011 |
3 | 10000120010202100122120122121 |
4 | 11033031022003303330003 |
5 | 11004401442420342403 |
6 | 120554111445345111 |
7 | 4565143354256356 |
oct | 517151203637403 |
9 | 100503670576577 |
10 | 23035152121603 |
11 | 7381175935a86 |
12 | 2700449a08197 |
13 | cb12896ca09b |
14 | 598c9b93c29d |
15 | 29e2e56a83bd |
hex | 14f34a0f3f03 |
23035152121603 has 8 divisors (see below), whose sum is σ = 23456189981808. Its totient is φ = 22617924559104.
The previous prime is 23035152121577. The next prime is 23035152121697. The reversal of 23035152121603 is 30612125153032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23035152121603 - 225 = 23035118567171 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23035152121703) 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, 952562226 + ... + 952586407.
It is an arithmetic number, because the mean of its divisors is an integer number (2932023747726).
Almost surely, 223035152121603 is an apocalyptic number.
23035152121603 is a deficient number, since it is larger than the sum of its proper divisors (421037860205).
23035152121603 is a wasteful number, since it uses less digits than its factorization.
23035152121603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1905148853.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 23035152121603 its reverse (30612125153032), we get a palindrome (53647277274635).
The spelling of 23035152121603 in words is "twenty-three trillion, thirty-five billion, one hundred fifty-two million, one hundred twenty-one thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •