Base | Representation |
---|---|
bin | 100010010001110110101… |
… | …011001100010101100111 |
3 | 22100012022010021210212111 |
4 | 202101312223030111213 |
5 | 302043314034044143 |
6 | 5002055104501451 |
7 | 332121533040433 |
oct | 42216653142547 |
9 | 8305263253774 |
10 | 2355633112423 |
11 | 829022531948 |
12 | 32065491a887 |
13 | 14119b1b19c6 |
14 | 820285099c3 |
15 | 4141e84699d |
hex | 22476acc567 |
2355633112423 has 8 divisors (see below), whose sum is σ = 2379550321440. Its totient is φ = 2331727552800.
The previous prime is 2355633112411. The next prime is 2355633112439. The reversal of 2355633112423 is 3242113365532.
2355633112423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2355633112423 - 29 = 2355633111911 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 (2355633112403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2505588 + ... + 3315001.
It is an arithmetic number, because the mean of its divisors is an integer number (297443790180).
Almost surely, 22355633112423 is an apocalyptic number.
2355633112423 is a deficient number, since it is larger than the sum of its proper divisors (23917209017).
2355633112423 is a wasteful number, since it uses less digits than its factorization.
2355633112423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5824697.
The product of its digits is 388800, while the sum is 40.
Adding to 2355633112423 its reverse (3242113365532), we get a palindrome (5597746477955).
The spelling of 2355633112423 in words is "two trillion, three hundred fifty-five billion, six hundred thirty-three million, one hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •