Base | Representation |
---|---|
bin | 11101011100001000001… |
… | …01000000110010101001 |
3 | 10120200221111012202110121 |
4 | 32232010011000302221 |
5 | 113033110001033113 |
6 | 2052405243243241 |
7 | 133036510341106 |
oct | 16560405006251 |
9 | 3520844182417 |
10 | 1011533221033 |
11 | 35aa97150625 |
12 | 144060519521 |
13 | 7450580a39a |
14 | 36d5c079aad |
15 | 1b4a4031e8d |
hex | eb84140ca9 |
1011533221033 has 4 divisors (see below), whose sum is σ = 1011554074960. Its totient is φ = 1011512367108.
The previous prime is 1011533221021. The next prime is 1011533221037. The reversal of 1011533221033 is 3301223351101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1011533221033 - 29 = 1011533220521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011533220989 and 1011533221007.
It is not an unprimeable number, because it can be changed into a prime (1011533221037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10354035 + ... + 10451272.
It is an arithmetic number, because the mean of its divisors is an integer number (252888518740).
Almost surely, 21011533221033 is an apocalyptic number.
It is an amenable number.
1011533221033 is a deficient number, since it is larger than the sum of its proper divisors (20853927).
1011533221033 is an equidigital number, since it uses as much as digits as its factorization.
1011533221033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20853926.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 1011533221033 its reverse (3301223351101), we get a palindrome (4312756572134).
The spelling of 1011533221033 in words is "one trillion, eleven billion, five hundred thirty-three million, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •