Base | Representation |
---|---|
bin | 10011100100010100… |
… | …11001001110000000 |
3 | 1000010010111121020000 |
4 | 21302022121032000 |
5 | 133003321340302 |
6 | 4454232120000 |
7 | 521221152603 |
oct | 116212311600 |
9 | 30103447200 |
10 | 10505261952 |
11 | 4500a45879 |
12 | 2052236000 |
13 | cb5595643 |
14 | 7192c833a |
15 | 41741531c |
hex | 272299380 |
10505261952 has 80 divisors (see below), whose sum is σ = 31263520200. Its totient is φ = 3501750528.
The previous prime is 10505261951. The next prime is 10505261957. The reversal of 10505261952 is 25916250501.
10505261952 is a `hidden beast` number, since 1 + 0 + 505 + 2 + 61 + 95 + 2 = 666.
It is a super-2 number, since 2×105052619522 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505261951) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 496252 + ... + 516987.
Almost surely, 210505261952 is an apocalyptic number.
10505261952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10505261952 is an abundant number, since it is smaller than the sum of its proper divisors (20758258248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10505261952 is an equidigital number, since it uses as much as digits as its factorization.
10505261952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013265 (or 1013244 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 10505261952 in words is "ten billion, five hundred five million, two hundred sixty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •