Base | Representation |
---|---|
bin | 100010110100010… |
… | …0110110000010000 |
3 | 10000102022101110011 |
4 | 1011220212300100 |
5 | 4343034204100 |
6 | 311532044304 |
7 | 40644102661 |
oct | 10550466020 |
9 | 3012271404 |
10 | 1168272400 |
11 | 54a506389 |
12 | 287303694 |
13 | 158066059 |
14 | b1231368 |
15 | 6c86ebba |
hex | 45a26c10 |
1168272400 has 45 divisors (see below), whose sum is σ = 2808417751. Its totient is φ = 467035520.
The previous prime is 1168272397. The next prime is 1168272401. The reversal of 1168272400 is 42728611.
The square root of 1168272400 is 34180.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 247999504 + 920272896 = 15748^2 + 30336^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1168272401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 682746 + ... + 684454.
Almost surely, 21168272400 is an apocalyptic number.
1168272400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1168272400 is the 34180-th square number.
It is an amenable number.
1168272400 is an abundant number, since it is smaller than the sum of its proper divisors (1640145351).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1168272400 is an frugal number, since it uses more digits than its factorization.
1168272400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3436 (or 1716 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 31.
The cubic root of 1168272400 is about 1053.2093491128.
The spelling of 1168272400 in words is "one billion, one hundred sixty-eight million, two hundred seventy-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •