Base | Representation |
---|---|
bin | 1010000110101100000001… |
… | …0100011001101011101000 |
3 | 1110100002212211122100221222 |
4 | 2201223000110121223220 |
5 | 2424011301033013000 |
6 | 35343511414321212 |
7 | 2224446311566163 |
oct | 241530024315350 |
9 | 43302784570858 |
10 | 11110012001000 |
11 | 35a3803156600 |
12 | 12b5240659208 |
13 | 627892263533 |
14 | 2a5a281a0ada |
15 | 143ee4872a85 |
hex | a1ac0519ae8 |
11110012001000 has 96 divisors (see below), whose sum is σ = 28575685724040. Its totient is φ = 4040004320000.
The previous prime is 11110012000861. The next prime is 11110012001009. The reversal of 11110012001000 is 10021001111.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3748351556356 + 7361660444644 = 1936066^2 + 2713238^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (11110012001009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45788141 + ... + 46030140.
Almost surely, 211110012001000 is an apocalyptic number.
11110012001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110012001000 is an abundant number, since it is smaller than the sum of its proper divisors (17465673723040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110012001000 is a wasteful number, since it uses less digits than its factorization.
11110012001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91818324 (or 91818299 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11110012001000 its reverse (10021001111), we get a palindrome (11120033002111).
The spelling of 11110012001000 in words is "eleven trillion, one hundred ten billion, twelve million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •