Base | Representation |
---|---|
bin | 1010010001110111001111… |
… | …0000110100011101101111 |
3 | 1111000110102220001211001020 |
4 | 2210131303300310131233 |
5 | 2440132444242232143 |
6 | 40012022335545223 |
7 | 2244354060361140 |
oct | 244356360643557 |
9 | 44013386054036 |
10 | 11302001133423 |
11 | 3668173aa7390 |
12 | 13264a138b213 |
13 | 63ca0aa05b80 |
14 | 2b103c389ac7 |
15 | 148ece8a1883 |
hex | a4773c3476f |
11302001133423 has 128 divisors (see below), whose sum is σ = 21793148805120. Its totient is φ = 5014898542080.
The previous prime is 11302001133403. The next prime is 11302001133433. The reversal of 11302001133423 is 32433110020311.
It is not a de Polignac number, because 11302001133423 - 28 = 11302001133167 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11302001133393 and 11302001133402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11302001133403) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 150165 + ... + 4756737.
It is an arithmetic number, because the mean of its divisors is an integer number (170258975040).
Almost surely, 211302001133423 is an apocalyptic number.
11302001133423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11302001133423 is a deficient number, since it is larger than the sum of its proper divisors (10491147671697).
11302001133423 is a wasteful number, since it uses less digits than its factorization.
11302001133423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4606669.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11302001133423 its reverse (32433110020311), we get a palindrome (43735111153734).
The spelling of 11302001133423 in words is "eleven trillion, three hundred two billion, one million, one hundred thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •