Base | Representation |
---|---|
bin | 11101111110101111000… |
… | …10011101110001100001 |
3 | 10122110220100221120201102 |
4 | 32333113202131301201 |
5 | 113334133002220113 |
6 | 2105121051244145 |
7 | 134265111515000 |
oct | 16772742356141 |
9 | 3573810846642 |
10 | 1030113320033 |
11 | 367961128a46 |
12 | 147786a49655 |
13 | 761a6c891c5 |
14 | 37c0194cc37 |
15 | 1bbe02c6758 |
hex | efd789dc61 |
1030113320033 has 8 divisors (see below), whose sum is σ = 1201298332800. Its totient is φ = 882954274020.
The previous prime is 1030113320029. The next prime is 1030113320069. The reversal of 1030113320033 is 3300233110301.
It is not a de Polignac number, because 1030113320033 - 22 = 1030113320029 is a prime.
It is a super-2 number, since 2×10301133200332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030113319987 and 1030113320014.
It is not an unprimeable number, because it can be changed into a prime (1030113320633) 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, 1501622573 + ... + 1501623258.
It is an arithmetic number, because the mean of its divisors is an integer number (150162291600).
Almost surely, 21030113320033 is an apocalyptic number.
It is an amenable number.
1030113320033 is a deficient number, since it is larger than the sum of its proper divisors (171185012767).
1030113320033 is an frugal number, since it uses more digits than its factorization.
1030113320033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3003245852 (or 3003245838 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1030113320033 its reverse (3300233110301), we get a palindrome (4330346430334).
The spelling of 1030113320033 in words is "one trillion, thirty billion, one hundred thirteen million, three hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •