Base | Representation |
---|---|
bin | 101000110001100… |
… | …0110011111000000 |
3 | 10112100102112100000 |
4 | 1101203012133000 |
5 | 10300221443341 |
6 | 343432200000 |
7 | 45622064166 |
oct | 12143063700 |
9 | 3470375300 |
10 | 1368156096 |
11 | 642319a1a |
12 | 322239000 |
13 | 18a5ac428 |
14 | cd9c3236 |
15 | 801a48b6 |
hex | 518c67c0 |
1368156096 has 84 divisors (see below), whose sum is σ = 4066862072. Its totient is φ = 456046848.
The previous prime is 1368156079. The next prime is 1368156109. The reversal of 1368156096 is 6906518631.
1368156096 is a `hidden beast` number, since 1 + 3 + 6 + 81 + 560 + 9 + 6 = 666.
It is a super-2 number, since 2×13681560962 = 3743702206043922432, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28435 + ... + 59538.
Almost surely, 21368156096 is an apocalyptic number.
1368156096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1368156096 is an abundant number, since it is smaller than the sum of its proper divisors (2698705976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1368156096 is an frugal number, since it uses more digits than its factorization.
1368156096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88000 (or 87978 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The square root of 1368156096 is about 36988.5941338678. The cubic root of 1368156096 is about 1110.1420417205.
It can be divided in two parts, 1368 and 156096, that added together give a cube (157464 = 543).
The spelling of 1368156096 in words is "one billion, three hundred sixty-eight million, one hundred fifty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •