Base | Representation |
---|---|
bin | 11000011101000110… |
… | …00010100001001100 |
3 | 1020212222110200200000 |
4 | 30032203002201030 |
5 | 203342003441033 |
6 | 10010435204300 |
7 | 643230250263 |
oct | 141643024114 |
9 | 36788420600 |
10 | 13128968268 |
11 | 5627a621a9 |
12 | 2664a46690 |
13 | 13130189a0 |
14 | 8c793b5da |
15 | 51c929a13 |
hex | 30e8c284c |
13128968268 has 144 divisors (see below), whose sum is σ = 37673484576. Its totient is φ = 3973224960.
The previous prime is 13128968257. The next prime is 13128968339. The reversal of 13128968268 is 86286982131.
13128968268 is a `hidden beast` number, since 1 + 312 + 8 + 9 + 68 + 268 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
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 47 ways as a sum of consecutive naturals, for example, 762280 + ... + 779312.
Almost surely, 213128968268 is an apocalyptic number.
13128968268 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13128968268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18836742288).
13128968268 is an abundant number, since it is smaller than the sum of its proper divisors (24544516308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13128968268 is a wasteful number, since it uses less digits than its factorization.
13128968268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17126 (or 17112 counting only the distinct ones).
The product of its digits is 1990656, while the sum is 54.
The spelling of 13128968268 in words is "thirteen billion, one hundred twenty-eight million, nine hundred sixty-eight thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •