Base | Representation |
---|---|
bin | 100101110100001… |
… | …1110011010110000 |
3 | 10021102122212200210 |
4 | 1023220132122300 |
5 | 10044314322202 |
6 | 325524544120 |
7 | 43305325302 |
oct | 11350363260 |
9 | 3242585623 |
10 | 1268901552 |
11 | 5a1297576 |
12 | 2b4b52040 |
13 | 172b6a029 |
14 | c0747972 |
15 | 765eac6c |
hex | 4ba1e6b0 |
1268901552 has 20 divisors (see below), whose sum is σ = 3277995800. Its totient is φ = 422967168.
The previous prime is 1268901509. The next prime is 1268901553. The reversal of 1268901552 is 2551098621.
It is a super-2 number, since 2×12689015522 = 3220222297336017408, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1268901552.
It is not an unprimeable number, because it can be changed into a prime (1268901553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13217677 + ... + 13217772.
It is an arithmetic number, because the mean of its divisors is an integer number (163899790).
Almost surely, 21268901552 is an apocalyptic number.
1268901552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1268901552 is an abundant number, since it is smaller than the sum of its proper divisors (2009094248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1268901552 is a wasteful number, since it uses less digits than its factorization.
1268901552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26435460 (or 26435454 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 39.
The square root of 1268901552 is about 35621.6444314408. The cubic root of 1268901552 is about 1082.6198263349.
The spelling of 1268901552 in words is "one billion, two hundred sixty-eight million, nine hundred one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •