Base | Representation |
---|---|
bin | 11101011011001100001… |
… | …01110101101011110000 |
3 | 10120122122102112122020110 |
4 | 32231212011311223300 |
5 | 113031042202334300 |
6 | 2052243312141320 |
7 | 133021161143541 |
oct | 16554605655360 |
9 | 3518572478213 |
10 | 1011030121200 |
11 | 35a859167240 |
12 | 143b3bb37840 |
13 | 7445550b388 |
14 | 36d113184c8 |
15 | 1b474ca5550 |
hex | eb66175af0 |
1011030121200 has 480 divisors, whose sum is σ = 3621017740032. Its totient is φ = 239016960000.
The previous prime is 1011030121193. The next prime is 1011030121229. The reversal of 1011030121200 is 21210301101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 531840250 + ... + 531842150.
Almost surely, 21011030121200 is an apocalyptic number.
1011030121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1011030121200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1810508870016).
1011030121200 is an abundant number, since it is smaller than the sum of its proper divisors (2609987618832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011030121200 is a wasteful number, since it uses less digits than its factorization.
1011030121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2913 (or 2902 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1011030121200 its reverse (21210301101), we get a palindrome (1032240422301).
The spelling of 1011030121200 in words is "one trillion, eleven billion, thirty million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •