Base | Representation |
---|---|
bin | 1010011110101110100001… |
… | …1100101110101111001010 |
3 | 1111210120212211102211200110 |
4 | 2213223220130232233022 |
5 | 3002243102021232300 |
6 | 40301332154215150 |
7 | 2266336510026363 |
oct | 247535034565712 |
9 | 44716784384613 |
10 | 11523002133450 |
11 | 3742972333755 |
12 | 136129a1244b6 |
13 | 6577cabca082 |
14 | 2bba05680b6a |
15 | 14eb168be550 |
hex | a7ae872ebca |
11523002133450 has 24 divisors (see below), whose sum is σ = 28577045291328. Its totient is φ = 3072800568880.
The previous prime is 11523002133431. The next prime is 11523002133451. The reversal of 11523002133450 is 5433120032511.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (11523002133451) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38410006962 + ... + 38410007261.
It is an arithmetic number, because the mean of its divisors is an integer number (1190710220472).
Almost surely, 211523002133450 is an apocalyptic number.
11523002133450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11523002133450 is an abundant number, since it is smaller than the sum of its proper divisors (17054043157878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11523002133450 is a wasteful number, since it uses less digits than its factorization.
11523002133450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76820014238 (or 76820014233 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 11523002133450 its reverse (5433120032511), we get a palindrome (16956122165961).
The spelling of 11523002133450 in words is "eleven trillion, five hundred twenty-three billion, two million, one hundred thirty-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •