Base | Representation |
---|---|
bin | 11000101010110101111… |
… | …000000010010001000100 |
3 | 20000001210011201201002000 |
4 | 120222311320002101010 |
5 | 210233402212330233 |
6 | 3334443502545300 |
7 | 233323222215552 |
oct | 30526570022104 |
9 | 6001704651060 |
10 | 1695268480068 |
11 | 5a3a60952639 |
12 | 234679b98230 |
13 | c3b2b3b9c37 |
14 | 5c0a11b6bd2 |
15 | 2e17024bd13 |
hex | 18ab5e02444 |
1695268480068 has 48 divisors (see below), whose sum is σ = 4414502420160. Its totient is φ = 562600104192.
The previous prime is 1695268480067. The next prime is 1695268480133. The reversal of 1695268480068 is 8600848625961.
1695268480068 is a `hidden beast` number, since 1 + 6 + 9 + 526 + 8 + 48 + 0 + 0 + 68 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 1695268479987 and 1695268480014.
It is not an unprimeable number, because it can be changed into a prime (1695268480067) 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, 34550221 + ... + 34599252.
It is an arithmetic number, because the mean of its divisors is an integer number (91968800420).
Almost surely, 21695268480068 is an apocalyptic number.
1695268480068 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1695268480068 is an abundant number, since it is smaller than the sum of its proper divisors (2719233940092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1695268480068 is a wasteful number, since it uses less digits than its factorization.
1695268480068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69149713 (or 69149705 counting only the distinct ones).
The product of its (nonzero) digits is 39813120, while the sum is 63.
The spelling of 1695268480068 in words is "one trillion, six hundred ninety-five billion, two hundred sixty-eight million, four hundred eighty thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •