Base | Representation |
---|---|
bin | 100011011010000010100… |
… | …100111110110100010111 |
3 | 22121121100212100112201102 |
4 | 203122002210332310113 |
5 | 304331033402101403 |
6 | 5101434202020315 |
7 | 340534350434225 |
oct | 43320244766427 |
9 | 8547325315642 |
10 | 2433142222103 |
11 | 85898739718a |
12 | 3336864a769b |
13 | 1485a1256908 |
14 | 85a9c525b15 |
15 | 434592d8b88 |
hex | 2368293ed17 |
2433142222103 has 8 divisors (see below), whose sum is σ = 2493882017472. Its totient is φ = 2372776210656.
The previous prime is 2433142222039. The next prime is 2433142222171. The reversal of 2433142222103 is 3012222413342.
2433142222103 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 2433142222103 - 26 = 2433142222039 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 (2433142222703) 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, 93432800 + ... + 93458837.
It is an arithmetic number, because the mean of its divisors is an integer number (311735252184).
Almost surely, 22433142222103 is an apocalyptic number.
2433142222103 is a deficient number, since it is larger than the sum of its proper divisors (60739795369).
2433142222103 is a wasteful number, since it uses less digits than its factorization.
2433142222103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186891961.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 2433142222103 its reverse (3012222413342), we get a palindrome (5445364635445).
The spelling of 2433142222103 in words is "two trillion, four hundred thirty-three billion, one hundred forty-two million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •