Base | Representation |
---|---|
bin | 100101110100010… |
… | …1010001000000000 |
3 | 10021102202022110210 |
4 | 1023220222020000 |
5 | 10044322341004 |
6 | 325525554120 |
7 | 43305615144 |
oct | 11350521000 |
9 | 3242668423 |
10 | 1268949504 |
11 | 5a131a5a9 |
12 | 2b4b75940 |
13 | 172b85ac4 |
14 | c075b224 |
15 | 7660a089 |
hex | 4ba2a200 |
1268949504 has 80 divisors (see below), whose sum is σ = 3558566880. Its totient is φ = 400711680.
The previous prime is 1268949497. The next prime is 1268949527. The reversal of 1268949504 is 4059498621.
It is a super-2 number, since 2×12689495042 = 3220465687403692032, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7444 + ... + 50924.
It is an arithmetic number, because the mean of its divisors is an integer number (44482086).
Almost surely, 21268949504 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1268949504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1779283440).
1268949504 is an abundant number, since it is smaller than the sum of its proper divisors (2289617376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1268949504 is an equidigital number, since it uses as much as digits as its factorization.
1268949504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43521 (or 43505 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 48.
The square root of 1268949504 is about 35622.3174990062. The cubic root of 1268949504 is about 1082.6334636240.
The spelling of 1268949504 in words is "one billion, two hundred sixty-eight million, nine hundred forty-nine thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •