Base | Representation |
---|---|
bin | 10101001111001010… |
… | …00000010010111001 |
3 | 1002102120210122221122 |
4 | 22213211000102321 |
5 | 141322231231301 |
6 | 5123204115025 |
7 | 552352362200 |
oct | 124745002271 |
9 | 32376718848 |
10 | 11401430201 |
11 | 49208a0297 |
12 | 2262395a75 |
13 | 10c9149c05 |
14 | 7a2328237 |
15 | 46ae3681b |
hex | 2a79404b9 |
11401430201 has 24 divisors (see below), whose sum is σ = 13728109824. Its totient is φ = 9431583840.
The previous prime is 11401430197. The next prime is 11401430221. The reversal of 11401430201 is 10203410411.
It is a happy number.
It is not a de Polignac number, because 11401430201 - 22 = 11401430197 is a prime.
It is a super-2 number, since 2×114014302012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11401430201.
It is not an unprimeable number, because it can be changed into a prime (11401430221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 556526 + ... + 576648.
It is an arithmetic number, because the mean of its divisors is an integer number (572004576).
Almost surely, 211401430201 is an apocalyptic number.
It is an amenable number.
11401430201 is a deficient number, since it is larger than the sum of its proper divisors (2326679623).
11401430201 is a wasteful number, since it uses less digits than its factorization.
11401430201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20541 (or 20534 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11401430201 its reverse (10203410411), we get a palindrome (21604840612).
It can be divided in two parts, 1140 and 1430201, that added together give a palindrome (1431341).
The spelling of 11401430201 in words is "eleven billion, four hundred one million, four hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •