Base | Representation |
---|---|
bin | 10101001111000111… |
… | …10011001010111100 |
3 | 1002102120012121121121 |
4 | 22213203303022330 |
5 | 141322141124200 |
6 | 5123153240324 |
7 | 552346605202 |
oct | 124743631274 |
9 | 32376177547 |
10 | 11401114300 |
11 | 49206a4a14 |
12 | 22622630a4 |
13 | 10c90691a4 |
14 | 7a2285072 |
15 | 46adc2e1a |
hex | 2a78f32bc |
11401114300 has 36 divisors (see below), whose sum is σ = 25266820320. Its totient is φ = 4463413120.
The previous prime is 11401114297. The next prime is 11401114301. The reversal of 11401114300 is 341110411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401114301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1208185 + ... + 1217584.
It is an arithmetic number, because the mean of its divisors is an integer number (701856120).
Almost surely, 211401114300 is an apocalyptic number.
11401114300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11401114300 is an abundant number, since it is smaller than the sum of its proper divisors (13865706020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11401114300 is a wasteful number, since it uses less digits than its factorization.
11401114300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2425830 (or 2425823 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11401114300 its reverse (341110411), we get a palindrome (11742224711).
It can be divided in two parts, 1140111 and 4300, that added together give a palindrome (1144411).
The spelling of 11401114300 in words is "eleven billion, four hundred one million, one hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •