Base | Representation |
---|---|
bin | 10101010111001111101… |
… | …011011001000111101110 |
3 | 12012100100012010220000000 |
4 | 111113033223121013232 |
5 | 143023100413403414 |
6 | 3042230550245130 |
7 | 211031045004555 |
oct | 25271753310756 |
9 | 5170305126000 |
10 | 1468068106734 |
11 | 5166711a0359 |
12 | 1b86310567a6 |
13 | a8590a31cc8 |
14 | 510aa814d9c |
15 | 282c3d62b09 |
hex | 155cfad91ee |
1468068106734 has 32 divisors (see below), whose sum is σ = 3302649797280. Its totient is φ = 489356034120.
The previous prime is 1468068106679. The next prime is 1468068106777. The reversal of 1468068106734 is 4376018608641.
1468068106734 is a `hidden beast` number, since 1 + 468 + 0 + 6 + 8 + 106 + 73 + 4 = 666.
It is a super-2 number, since 2×14680681067342 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167813197 + ... + 167821944.
It is an arithmetic number, because the mean of its divisors is an integer number (103207806165).
Almost surely, 21468068106734 is an apocalyptic number.
1468068106734 is an abundant number, since it is smaller than the sum of its proper divisors (1834581690546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1468068106734 is an frugal number, since it uses more digits than its factorization.
1468068106734 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335635164 (or 335635146 counting only the distinct ones).
The product of its (nonzero) digits is 4644864, while the sum is 54.
The spelling of 1468068106734 in words is "one trillion, four hundred sixty-eight billion, sixty-eight million, one hundred six thousand, seven hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •