Base | Representation |
---|---|
bin | 1001000110001001000100… |
… | …1101111101011101001000 |
3 | 1022102002122021010101011001 |
4 | 2101202101031331131020 |
5 | 2302324243234033000 |
6 | 33134241243144344 |
7 | 2051362040146606 |
oct | 221422115753510 |
9 | 38362567111131 |
10 | 10001120221000 |
11 | 32064a66aa6a7 |
12 | 115634ab150b4 |
13 | 57714226909c |
14 | 2680b1c12876 |
15 | 12524347046a |
hex | 9189137d748 |
10001120221000 has 32 divisors (see below), whose sum is σ = 23402621319480. Its totient is φ = 4000448088000.
The previous prime is 10001120220997. The next prime is 10001120221009. The reversal of 10001120221000 is 12202110001.
It can be written as a sum of positive squares in 4 ways, for example, as 5683293889156 + 4317826331844 = 2383966^2 + 2077938^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (10001120221009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5000559111 + ... + 5000561110.
Almost surely, 210001120221000 is an apocalyptic number.
10001120221000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001120221000 is an abundant number, since it is smaller than the sum of its proper divisors (13401501098480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001120221000 is a wasteful number, since it uses less digits than its factorization.
10001120221000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10001120242 (or 10001120228 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10001120221000 its reverse (12202110001), we get a palindrome (10013322331001).
The spelling of 10001120221000 in words is "ten trillion, one billion, one hundred twenty million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •