Base | Representation |
---|---|
bin | 11111011000110101010… |
… | …01101101001001101011 |
3 | 10211002202101210020211021 |
4 | 33230122221231021223 |
5 | 120132213341304010 |
6 | 2143240525313311 |
7 | 140626560110416 |
oct | 17543251551153 |
9 | 3732671706737 |
10 | 1078483931755 |
11 | 38642307750a |
12 | 155026105837 |
13 | 7a9152a3749 |
14 | 3a2adad8b7d |
15 | 1d0c1ab48da |
hex | fb1aa6d26b |
1078483931755 has 48 divisors (see below), whose sum is σ = 1368071812800. Its totient is φ = 814997272320.
The previous prime is 1078483931731. The next prime is 1078483931761. The reversal of 1078483931755 is 5571393848701.
It is not a de Polignac number, because 1078483931755 - 29 = 1078483931243 is a prime.
It is a hoax number, since the sum of its digits (61) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a junction number, because it is equal to n+sod(n) for n = 1078483931693 and 1078483931702.
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 47 ways as a sum of consecutive naturals, for example, 350269306 + ... + 350272384.
It is an arithmetic number, because the mean of its divisors is an integer number (28501496100).
Almost surely, 21078483931755 is an apocalyptic number.
1078483931755 is a deficient number, since it is larger than the sum of its proper divisors (289587881045).
1078483931755 is an equidigital number, since it uses as much as digits as its factorization.
1078483931755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3572 (or 3373 counting only the distinct ones).
The product of its (nonzero) digits is 25401600, while the sum is 61.
The spelling of 1078483931755 in words is "one trillion, seventy-eight billion, four hundred eighty-three million, nine hundred thirty-one thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •