Base | Representation |
---|---|
bin | 11111001100111000111… |
… | …00111001011010000000 |
3 | 10210111012111222222201110 |
4 | 33212130130321122000 |
5 | 120031100322140233 |
6 | 2140300344403320 |
7 | 140311635621663 |
oct | 17463434713200 |
9 | 3714174888643 |
10 | 1072071677568 |
11 | 383732570a91 |
12 | 153936776540 |
13 | 7a1329957b8 |
14 | 39c622556da |
15 | 1cd48b97663 |
hex | f99c739680 |
1072071677568 has 64 divisors (see below), whose sum is σ = 2847799134720. Its totient is φ = 357343580160.
The previous prime is 1072071677561. The next prime is 1072071677581. The reversal of 1072071677568 is 8657761702701.
1072071677568 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×10720716775682 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1072071677561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17737896 + ... + 17798232.
It is an arithmetic number, because the mean of its divisors is an integer number (44496861480).
Almost surely, 21072071677568 is an apocalyptic number.
It is an amenable number.
1072071677568 is an abundant number, since it is smaller than the sum of its proper divisors (1775727457152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1072071677568 is an equidigital number, since it uses as much as digits as its factorization.
1072071677568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106625 (or 106613 counting only the distinct ones).
The product of its (nonzero) digits is 6914880, while the sum is 57.
The spelling of 1072071677568 in words is "one trillion, seventy-two billion, seventy-one million, six hundred seventy-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •