Base | Representation |
---|---|
bin | 1010010001110111101011… |
… | …1010100100111111111110 |
3 | 1111000110202020212101012002 |
4 | 2210131322322210333332 |
5 | 2440133221002211110 |
6 | 40012042303542302 |
7 | 2244360045345251 |
oct | 244357272447776 |
9 | 44013666771162 |
10 | 11302121132030 |
11 | 3668225808093 |
12 | 13265155ba992 |
13 | 63ca2982c271 |
14 | 2b10502a5098 |
15 | 148eda1a6aa5 |
hex | a477aea4ffe |
11302121132030 has 8 divisors (see below), whose sum is σ = 20343818037672. Its totient is φ = 4520848452808.
The previous prime is 11302121132017. The next prime is 11302121132033. The reversal of 11302121132030 is 3023112120311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11302121131993 and 11302121132011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11302121132033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 565106056592 + ... + 565106056611.
It is an arithmetic number, because the mean of its divisors is an integer number (2542977254709).
Almost surely, 211302121132030 is an apocalyptic number.
11302121132030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11302121132030 is a deficient number, since it is larger than the sum of its proper divisors (9041696905642).
11302121132030 is a wasteful number, since it uses less digits than its factorization.
11302121132030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1130212113210.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11302121132030 its reverse (3023112120311), we get a palindrome (14325233252341).
The spelling of 11302121132030 in words is "eleven trillion, three hundred two billion, one hundred twenty-one million, one hundred thirty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •