Base | Representation |
---|---|
bin | 10000001101111001110… |
… | …111001100000010000000 |
3 | 10221112120022102121110002 |
4 | 100031321313030002000 |
5 | 121224333401240000 |
6 | 2211544523055132 |
7 | 143341613353661 |
oct | 20157167140200 |
9 | 3845508377402 |
10 | 1114441040000 |
11 | 39a6a4a060a2 |
12 | 15bba00714a8 |
13 | 81125897762 |
14 | 3bd21389368 |
15 | 1dec86a28d5 |
hex | 10379dcc080 |
1114441040000 has 80 divisors (see below), whose sum is σ = 2774331515670. Its totient is φ = 445776384000.
The previous prime is 1114441039997. The next prime is 1114441040129. The reversal of 1114441040000 is 401444111.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 31449664 + 1114409590336 = 5608^2 + 1055656^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6885257 + ... + 7045256.
Almost surely, 21114441040000 is an apocalyptic number.
1114441040000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1114441040000 is an abundant number, since it is smaller than the sum of its proper divisors (1659890475670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114441040000 is an frugal number, since it uses more digits than its factorization.
1114441040000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13930547 (or 13930520 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1114441040000 its reverse (401444111), we get a palindrome (1114842484111).
The spelling of 1114441040000 in words is "one trillion, one hundred fourteen billion, four hundred forty-one million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •