Base | Representation |
---|---|
bin | 11101111111000101100… |
… | …11011000010000000001 |
3 | 10122111101112112220221012 |
4 | 32333202303120100001 |
5 | 113340024342200413 |
6 | 2105151522010305 |
7 | 134302565036300 |
oct | 16774263302001 |
9 | 3574345486835 |
10 | 1030302303233 |
11 | 367a48876905 |
12 | 14781a1a6995 |
13 | 76207186b98 |
14 | 37c1caa4437 |
15 | 1bc01ba67a8 |
hex | efe2cd8401 |
1030302303233 has 24 divisors (see below), whose sum is σ = 1201324193280. Its totient is φ = 881047416480.
The previous prime is 1030302303193. The next prime is 1030302303259. The reversal of 1030302303233 is 3323032030301.
It is not a de Polignac number, because 1030302303233 - 212 = 1030302299137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030302303199 and 1030302303208.
It is not an unprimeable number, because it can be changed into a prime (1030302305233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145048160 + ... + 145055262.
It is an arithmetic number, because the mean of its divisors is an integer number (50055174720).
Almost surely, 21030302303233 is an apocalyptic number.
It is an amenable number.
1030302303233 is a deficient number, since it is larger than the sum of its proper divisors (171021890047).
1030302303233 is an equidigital number, since it uses as much as digits as its factorization.
1030302303233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13637 (or 13630 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 1030302303233 its reverse (3323032030301), we get a palindrome (4353334333534).
The spelling of 1030302303233 in words is "one trillion, thirty billion, three hundred two million, three hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •