Base | Representation |
---|---|
bin | 10011101010111111… |
… | …11100100100001000 |
3 | 1000021000211202022222 |
4 | 21311133330210020 |
5 | 133112134242100 |
6 | 4503552033212 |
7 | 522501042041 |
oct | 116537744410 |
9 | 30230752288 |
10 | 10561243400 |
11 | 452a601534 |
12 | 2068b32808 |
13 | cc4066466 |
14 | 7228db8c8 |
15 | 41c2c2485 |
hex | 2757fc908 |
10561243400 has 24 divisors (see below), whose sum is σ = 24554891370. Its totient is φ = 4224497280.
The previous prime is 10561243367. The next prime is 10561243409. The reversal of 10561243400 is 434216501.
It can be written as a sum of positive squares in 3 ways, for example, as 9612233764 + 949009636 = 98042^2 + 30806^2 .
It is a super-2 number, since 2×105612434002 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10561243400.
It is not an unprimeable number, because it can be changed into a prime (10561243409) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26402909 + ... + 26403308.
Almost surely, 210561243400 is an apocalyptic number.
10561243400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10561243400 is an abundant number, since it is smaller than the sum of its proper divisors (13993647970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10561243400 is a wasteful number, since it uses less digits than its factorization.
10561243400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52806233 (or 52806224 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 10561243400 its reverse (434216501), we get a palindrome (10995459901).
The spelling of 10561243400 in words is "ten billion, five hundred sixty-one million, two hundred forty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •