Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …00011011110011100000 |
3 | 10120112222201020221112011 |
4 | 32230220300123303200 |
5 | 113021440240200000 |
6 | 2051553232442304 |
7 | 132653524461664 |
oct | 16545060336340 |
9 | 3515881227464 |
10 | 1010001100000 |
11 | 35a3803213a2 |
12 | 1438b33a9394 |
13 | 7432027c8a9 |
14 | 36c547b48a4 |
15 | 1b4147902ba |
hex | eb28c1bce0 |
1010001100000 has 72 divisors (see below), whose sum is σ = 2485390752936. Its totient is φ = 404000400000.
The previous prime is 1010001099983. The next prime is 1010001100001. The reversal of 1010001100000 is 11000101.
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010001100001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4950006 + ... + 5150005.
It is an arithmetic number, because the mean of its divisors is an integer number (34519316013).
Almost surely, 21010001100000 is an apocalyptic number.
1010001100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010001100000 is an abundant number, since it is smaller than the sum of its proper divisors (1475389652936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010001100000 is an frugal number, since it uses more digits than its factorization.
1010001100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100046 (or 10100018 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 1010001100000 its reverse (11000101), we get a palindrome (1010012100101).
The spelling of 1010001100000 in words is "one trillion, ten billion, one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •