Base | Representation |
---|---|
bin | 11111011110111001110… |
… | …01001011010100010100 |
3 | 10211102011111212020220000 |
4 | 33233130321023110110 |
5 | 120210402122024010 |
6 | 2144540141411300 |
7 | 141103410545052 |
oct | 17573471132424 |
9 | 3742144766800 |
10 | 1081742767380 |
11 | 3878456559a0 |
12 | 155795569b30 |
13 | 7b0144a2252 |
14 | 3a4dc83b1d2 |
15 | 1d212c357c0 |
hex | fbdce4b514 |
1081742767380 has 240 divisors, whose sum is σ = 3821384286720. Its totient is φ = 253781164800.
The previous prime is 1081742767361. The next prime is 1081742767429. The reversal of 1081742767380 is 837672471801.
1081742767380 is a `hidden beast` number, since 1 + 0 + 81 + 7 + 427 + 67 + 3 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 426675 + ... + 1531514.
It is an arithmetic number, because the mean of its divisors is an integer number (15922434528).
Almost surely, 21081742767380 is an apocalyptic number.
1081742767380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1081742767380 is an abundant number, since it is smaller than the sum of its proper divisors (2739641519340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1081742767380 is a wasteful number, since it uses less digits than its factorization.
1081742767380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1958252 (or 1958241 counting only the distinct ones).
The product of its (nonzero) digits is 3161088, while the sum is 54.
The spelling of 1081742767380 in words is "one trillion, eighty-one billion, seven hundred forty-two million, seven hundred sixty-seven thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •