Base | Representation |
---|---|
bin | 11111000110101000100… |
… | …10011101111110001001 |
3 | 10210011112110222220212222 |
4 | 33203110102131332021 |
5 | 120002211124004203 |
6 | 2134543223143425 |
7 | 140132500604306 |
oct | 17432422357611 |
9 | 3704473886788 |
10 | 1068713500553 |
11 | 382269a00986 |
12 | 153159ba4b75 |
13 | 79a190241ca |
14 | 39a242540ad |
15 | 1cbede52038 |
hex | f8d449df89 |
1068713500553 has 8 divisors (see below), whose sum is σ = 1071548679240. Its totient is φ = 1065878773120.
The previous prime is 1068713500537. The next prime is 1068713500571. The reversal of 1068713500553 is 3550053178601.
It can be written as a sum of positive squares in 4 ways, for example, as 203873019529 + 864840481024 = 451523^2 + 929968^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1068713500553 - 24 = 1068713500537 is a prime.
It is a super-2 number, since 2×10687135005532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1068713500583) 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, 4927901 + ... + 5140197.
It is an arithmetic number, because the mean of its divisors is an integer number (133943584905).
Almost surely, 21068713500553 is an apocalyptic number.
It is an amenable number.
1068713500553 is a deficient number, since it is larger than the sum of its proper divisors (2835178687).
1068713500553 is a wasteful number, since it uses less digits than its factorization.
1068713500553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225627.
The product of its (nonzero) digits is 378000, while the sum is 44.
The spelling of 1068713500553 in words is "one trillion, sixty-eight billion, seven hundred thirteen million, five hundred thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •