Base | Representation |
---|---|
bin | 11110010010100001111… |
… | …00010100001001011000 |
3 | 10200111022222001121202100 |
4 | 33021100330110021120 |
5 | 114022413424332242 |
6 | 2114035343403400 |
7 | 135122336445126 |
oct | 17112074241130 |
9 | 3614288047670 |
10 | 1040740074072 |
11 | 3714147045a6 |
12 | 1498518b3560 |
13 | 771ab77b94a |
14 | 3852d020916 |
15 | 1c1131d954c |
hex | f250f14258 |
1040740074072 has 24 divisors (see below), whose sum is σ = 2818671034140. Its totient is φ = 346913358000.
The previous prime is 1040740074037. The next prime is 1040740074083. The reversal of 1040740074072 is 2704700470401.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×10407400740722 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 5 ways as a sum of consecutive naturals, for example, 7227361554 + ... + 7227361697.
Almost surely, 21040740074072 is an apocalyptic number.
1040740074072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1040740074072 is an abundant number, since it is smaller than the sum of its proper divisors (1777930960068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040740074072 is a wasteful number, since it uses less digits than its factorization.
1040740074072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14454723263 (or 14454723256 counting only the distinct ones).
The product of its (nonzero) digits is 43904, while the sum is 36.
The spelling of 1040740074072 in words is "one trillion, forty billion, seven hundred forty million, seventy-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •