Base | Representation |
---|---|
bin | 11111010100010111000… |
… | …11001100000010010001 |
3 | 10210212120002011102020022 |
4 | 33222023203030002101 |
5 | 120112304232100421 |
6 | 2142202402553225 |
7 | 140513225162531 |
oct | 17521343140221 |
9 | 3725502142208 |
10 | 1076083081361 |
11 | 385400934032 |
12 | 154676068815 |
13 | 7a621a7aa02 |
14 | 3a122cd74c1 |
15 | 1ced0e217ab |
hex | fa8b8cc091 |
1076083081361 has 4 divisors (see below), whose sum is σ = 1077551135412. Its totient is φ = 1074615027312.
The previous prime is 1076083081343. The next prime is 1076083081373. The reversal of 1076083081361 is 1631803806701.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 505121496961 + 570961584400 = 710719^2 + 755620^2 .
It is a cyclic number.
It is not a de Polignac number, because 1076083081361 - 234 = 1058903212177 is a prime.
It is a super-2 number, since 2×10760830813612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1076083081301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 734025926 + ... + 734027391.
It is an arithmetic number, because the mean of its divisors is an integer number (269387783853).
Almost surely, 21076083081361 is an apocalyptic number.
It is an amenable number.
1076083081361 is a deficient number, since it is larger than the sum of its proper divisors (1468054051).
1076083081361 is an equidigital number, since it uses as much as digits as its factorization.
1076083081361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1468054050.
The product of its (nonzero) digits is 145152, while the sum is 44.
The spelling of 1076083081361 in words is "one trillion, seventy-six billion, eighty-three million, eighty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •