Base | Representation |
---|---|
bin | 11111010010100101110… |
… | …10000001110010001011 |
3 | 10210210002211222110111212 |
4 | 33221102322001302023 |
5 | 120103332442023441 |
6 | 2141524214243335 |
7 | 140450535511025 |
oct | 17512272016213 |
9 | 3723084873455 |
10 | 1075132767371 |
11 | 384a63467073 |
12 | 15444b95654b |
13 | 7a4ccc19040 |
14 | 3a072a01015 |
15 | 1ce777a6eeb |
hex | fa52e81c8b |
1075132767371 has 16 divisors (see below), whose sum is σ = 1226048078304. Its totient is φ = 933972125184.
The previous prime is 1075132767353. The next prime is 1075132767391. The reversal of 1075132767371 is 1737672315701.
1075132767371 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1075132767371 - 214 = 1075132750987 is a prime.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1075132767341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2459525 + ... + 2863481.
It is an arithmetic number, because the mean of its divisors is an integer number (76628004894).
Almost surely, 21075132767371 is an apocalyptic number.
1075132767371 is a deficient number, since it is larger than the sum of its proper divisors (150915310933).
1075132767371 is a wasteful number, since it uses less digits than its factorization.
1075132767371 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416030.
The product of its (nonzero) digits is 1296540, while the sum is 50.
The spelling of 1075132767371 in words is "one trillion, seventy-five billion, one hundred thirty-two million, seven hundred sixty-seven thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •