Base | Representation |
---|---|
bin | 10101001111001000… |
… | …01000110101001111 |
3 | 1002102120101010022122 |
4 | 22213210020311033 |
5 | 141322201444043 |
6 | 5123155203155 |
7 | 552350424650 |
oct | 124744106517 |
9 | 32376333278 |
10 | 11401203023 |
11 | 4920755641 |
12 | 22622a64bb |
13 | 10c909a6a2 |
14 | 7a22a9527 |
15 | 46adde368 |
hex | 2a7908d4f |
11401203023 has 16 divisors (see below), whose sum is σ = 13719141120. Its totient is φ = 9255819456.
The previous prime is 11401203013. The next prime is 11401203029. The reversal of 11401203023 is 32030210411.
11401203023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11401203023 - 232 = 7106235727 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11401202992 and 11401203010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401203029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 708515 + ... + 724427.
It is an arithmetic number, because the mean of its divisors is an integer number (857446320).
Almost surely, 211401203023 is an apocalyptic number.
11401203023 is a deficient number, since it is larger than the sum of its proper divisors (2317938097).
11401203023 is a wasteful number, since it uses less digits than its factorization.
11401203023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21326.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11401203023 its reverse (32030210411), we get a palindrome (43431413434).
The spelling of 11401203023 in words is "eleven billion, four hundred one million, two hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •