Base | Representation |
---|---|
bin | 11101111110100101100… |
… | …00100010001110101111 |
3 | 10122110200210001010000011 |
4 | 32333102300202032233 |
5 | 113334001434402343 |
6 | 2105105104314051 |
7 | 134263116036100 |
oct | 16772260421657 |
9 | 3573623033004 |
10 | 1030033122223 |
11 | 36791a932166 |
12 | 147764012927 |
13 | 76193489a91 |
14 | 37bd50343a7 |
15 | 1bbd823429d |
hex | efd2c223af |
1030033122223 has 24 divisors (see below), whose sum is σ = 1202235182784. Its totient is φ = 879917875200.
The previous prime is 1030033122197. The next prime is 1030033122227. The reversal of 1030033122223 is 3222213300301.
It is not a de Polignac number, because 1030033122223 - 217 = 1030032991151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030033122194 and 1030033122203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030033122227) 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 23 ways as a sum of consecutive naturals, for example, 20608303 + ... + 20658223.
It is an arithmetic number, because the mean of its divisors is an integer number (50093132616).
Almost surely, 21030033122223 is an apocalyptic number.
1030033122223 is a deficient number, since it is larger than the sum of its proper divisors (172202060561).
1030033122223 is an equidigital number, since it uses as much as digits as its factorization.
1030033122223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51343 (or 51336 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 1030033122223 its reverse (3222213300301), we get a palindrome (4252246422524).
The spelling of 1030033122223 in words is "one trillion, thirty billion, thirty-three million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •