Base | Representation |
---|---|
bin | 11101011011100001110… |
… | …01000110110110001010 |
3 | 10120200010001112011002200 |
4 | 32231300321012312022 |
5 | 113031430100124002 |
6 | 2052313304141030 |
7 | 133025521340043 |
oct | 16556071066612 |
9 | 3520101464080 |
10 | 1011211333002 |
11 | 35a941487362 |
12 | 143b90767776 |
13 | 74483c179b0 |
14 | 36d2b4098ca |
15 | 1b485b4cb1c |
hex | eb70e46d8a |
1011211333002 has 24 divisors (see below), whose sum is σ = 2359493110884. Its totient is φ = 311141948544.
The previous prime is 1011211333001. The next prime is 1011211333003. The reversal of 1011211333002 is 2003331121101.
It is an interprime number because it is at equal distance from previous prime (1011211333001) and next prime (1011211333003).
It can be written as a sum of positive squares in 2 ways, for example, as 984423136761 + 26788196241 = 992181^2 + 163671^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1011211333001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2160707743 + ... + 2160708210.
Almost surely, 21011211333002 is an apocalyptic number.
1011211333002 is an abundant number, since it is smaller than the sum of its proper divisors (1348281777882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011211333002 is a wasteful number, since it uses less digits than its factorization.
1011211333002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4321415974 (or 4321415971 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1011211333002 its reverse (2003331121101), we get a palindrome (3014542454103).
The spelling of 1011211333002 in words is "one trillion, eleven billion, two hundred eleven million, three hundred thirty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •