Base | Representation |
---|---|
bin | 11101011001011111111… |
… | …10111001010001000000 |
3 | 10120120022011101010110121 |
4 | 32230233332321101000 |
5 | 113022212304044300 |
6 | 2052013243110024 |
7 | 132656526101503 |
oct | 16545776712100 |
9 | 3516264333417 |
10 | 1010122331200 |
11 | 35a4327a4174 |
12 | 143927b12314 |
13 | 7433c418028 |
14 | 36c6693113a |
15 | 1b42023a81a |
hex | eb2ffb9440 |
1010122331200 has 168 divisors, whose sum is σ = 2513339225280. Its totient is φ = 399538944000.
The previous prime is 1010122331149. The next prime is 1010122331269. The reversal of 1010122331200 is 21332210101.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 142689261 + ... + 142696339.
Almost surely, 21010122331200 is an apocalyptic number.
1010122331200 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 1010122331200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1256669612640).
1010122331200 is an abundant number, since it is smaller than the sum of its proper divisors (1503216894080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010122331200 is a wasteful number, since it uses less digits than its factorization.
1010122331200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8085 (or 8070 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1010122331200 its reverse (21332210101), we get a palindrome (1031454541301).
The spelling of 1010122331200 in words is "one trillion, ten billion, one hundred twenty-two million, three hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •