Base | Representation |
---|---|
bin | 11101001001010001011… |
… | …01010010100100010100 |
3 | 10112201211000020011211002 |
4 | 32210220231102210110 |
5 | 112401342021404030 |
6 | 2044012551002432 |
7 | 132230611311536 |
oct | 16445055224424 |
9 | 3481730204732 |
10 | 1001410341140 |
11 | 356772038090 |
12 | 1420b6369418 |
13 | 73581528221 |
14 | 3667b88b856 |
15 | 1b0b04a0245 |
hex | e928b52914 |
1001410341140 has 24 divisors (see below), whose sum is σ = 2294140054752. Its totient is φ = 364149214880.
The previous prime is 1001410341103. The next prime is 1001410341199. The reversal of 1001410341140 is 411430141001.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2275932374 + ... + 2275932813.
It is an arithmetic number, because the mean of its divisors is an integer number (95589168948).
Almost surely, 21001410341140 is an apocalyptic number.
1001410341140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001410341140 is an abundant number, since it is smaller than the sum of its proper divisors (1292729713612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001410341140 is a wasteful number, since it uses less digits than its factorization.
1001410341140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4551865207 (or 4551865205 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1001410341140 its reverse (411430141001), we get a palindrome (1412840482141).
The spelling of 1001410341140 in words is "one trillion, one billion, four hundred ten million, three hundred forty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •