Base | Representation |
---|---|
bin | 10101001111001110… |
… | …00011001011111111 |
3 | 1002102121210220101110 |
4 | 22213213003023333 |
5 | 141322400410320 |
6 | 5123223413103 |
7 | 552360054234 |
oct | 124747031377 |
9 | 32377726343 |
10 | 11401966335 |
11 | 4921127081 |
12 | 22625b4193 |
13 | 10c92a6c56 |
14 | 7a242778b |
15 | 46aee05e0 |
hex | 2a79c32ff |
11401966335 has 16 divisors (see below), whose sum is σ = 18254494944. Its totient is φ = 6077265792.
The previous prime is 11401966333. The next prime is 11401966343. The reversal of 11401966335 is 53366910411.
It is not a de Polignac number, because 11401966335 - 21 = 11401966333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11401966293 and 11401966302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401966333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 211432 + ... + 259821.
It is an arithmetic number, because the mean of its divisors is an integer number (1140905934).
Almost surely, 211401966335 is an apocalyptic number.
11401966335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11401966335 is a deficient number, since it is larger than the sum of its proper divisors (6852528609).
11401966335 is a wasteful number, since it uses less digits than its factorization.
11401966335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472874.
The product of its (nonzero) digits is 58320, while the sum is 39.
The spelling of 11401966335 in words is "eleven billion, four hundred one million, nine hundred sixty-six thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •