Base | Representation |
---|---|
bin | 10101001000001101… |
… | …00000010110101000 |
3 | 1002021112001100121202 |
4 | 22210012200112220 |
5 | 141212313302100 |
6 | 5113322023332 |
7 | 551043534206 |
oct | 124406402650 |
9 | 32245040552 |
10 | 11343103400 |
11 | 48a0982522 |
12 | 2246947b48 |
13 | 10ba037705 |
14 | 7986a4076 |
15 | 465c647d5 |
hex | 2a41a05a8 |
11343103400 has 96 divisors (see below), whose sum is σ = 26737128000. Its totient is φ = 4474821120.
The previous prime is 11343103399. The next prime is 11343103423. The reversal of 11343103400 is 430134311.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11729717 + ... + 11730683.
It is an arithmetic number, because the mean of its divisors is an integer number (278511750).
Almost surely, 211343103400 is an apocalyptic number.
11343103400 is a gapful number since it is divisible by the number (10) 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 11343103400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13368564000).
11343103400 is an abundant number, since it is smaller than the sum of its proper divisors (15394024600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11343103400 is a wasteful number, since it uses less digits than its factorization.
11343103400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1731 (or 1722 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11343103400 its reverse (430134311), we get a palindrome (11773237711).
The spelling of 11343103400 in words is "eleven billion, three hundred forty-three million, one hundred three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •