Base | Representation |
---|---|
bin | 11101011011111001100… |
… | …11111011001011010000 |
3 | 10120200121222210120201111 |
4 | 32231330303323023100 |
5 | 113032332243113242 |
6 | 2052345210143104 |
7 | 133033500132244 |
oct | 16557463731320 |
9 | 3520558716644 |
10 | 1011411301072 |
11 | 35aa34348327 |
12 | 144027721a94 |
13 | 744b64905b3 |
14 | 36d49bc0424 |
15 | 1b49849c817 |
hex | eb7ccfb2d0 |
1011411301072 has 80 divisors (see below), whose sum is σ = 2091121159680. Its totient is φ = 472247322624.
The previous prime is 1011411301067. The next prime is 1011411301073. The reversal of 1011411301072 is 2701031141101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011411301073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17979133 + ... + 18035299.
It is an arithmetic number, because the mean of its divisors is an integer number (26139014496).
Almost surely, 21011411301072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1011411301072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1045560579840).
1011411301072 is an abundant number, since it is smaller than the sum of its proper divisors (1079709858608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011411301072 is a wasteful number, since it uses less digits than its factorization.
1011411301072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56708 (or 56702 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 1011411301072 its reverse (2701031141101), we get a palindrome (3712442442173).
The spelling of 1011411301072 in words is "one trillion, eleven billion, four hundred eleven million, three hundred one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •