Base | Representation |
---|---|
bin | 100001100000110110010… |
… | …010101100011111001111 |
3 | 22011011110221220110122102 |
4 | 201200312102230133033 |
5 | 300213032403404020 |
6 | 4521553440305315 |
7 | 325246550256503 |
oct | 41406622543717 |
9 | 8134427813572 |
10 | 2303013341135 |
11 | 80877aa9a961 |
12 | 31240a61223b |
13 | 139233768a70 |
14 | 7d675cac303 |
15 | 3ed8eeb8475 |
hex | 218364ac7cf |
2303013341135 has 8 divisors (see below), whose sum is σ = 2976201856320. Its totient is φ = 1700686774944.
The previous prime is 2303013341129. The next prime is 2303013341143. The reversal of 2303013341135 is 5311433103032.
2303013341135 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 2303013341135 - 214 = 2303013324751 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2303013341098 and 2303013341107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17715487175 + ... + 17715487304.
It is an arithmetic number, because the mean of its divisors is an integer number (372025232040).
Almost surely, 22303013341135 is an apocalyptic number.
2303013341135 is a deficient number, since it is larger than the sum of its proper divisors (673188515185).
2303013341135 is a wasteful number, since it uses less digits than its factorization.
2303013341135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35430974497.
The product of its (nonzero) digits is 9720, while the sum is 29.
Adding to 2303013341135 its reverse (5311433103032), we get a palindrome (7614446444167).
The spelling of 2303013341135 in words is "two trillion, three hundred three billion, thirteen million, three hundred forty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •