Base | Representation |
---|---|
bin | 11110111001011110101… |
… | …110111111001110100101 |
3 | 21111222121122121102121221 |
4 | 132321132232333032211 |
5 | 234242011111021013 |
6 | 4303233152540341 |
7 | 306255301403614 |
oct | 36713656771645 |
9 | 7458548542557 |
10 | 2123303220133 |
11 | 74954034a0a7 |
12 | 2a3615b516b1 |
13 | 1252c3bba664 |
14 | 74aa87ad87b |
15 | 3a372e7008d |
hex | 1ee5ebbf3a5 |
2123303220133 has 8 divisors (see below), whose sum is σ = 2132851317120. Its totient is φ = 2113756828320.
The previous prime is 2123303220131. The next prime is 2123303220139. The reversal of 2123303220133 is 3310223033212.
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 2123303220133 - 21 = 2123303220131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2123303220098 and 2123303220107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2123303220131) 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, 2103393 + ... + 2944633.
It is an arithmetic number, because the mean of its divisors is an integer number (266606414640).
Almost surely, 22123303220133 is an apocalyptic number.
It is an amenable number.
2123303220133 is a deficient number, since it is larger than the sum of its proper divisors (9548096987).
2123303220133 is a wasteful number, since it uses less digits than its factorization.
2123303220133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852587.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 2123303220133 its reverse (3310223033212), we get a palindrome (5433526253345).
The spelling of 2123303220133 in words is "two trillion, one hundred twenty-three billion, three hundred three million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •