Base | Representation |
---|---|
bin | 10000011101100010000… |
… | …101100101011111111010 |
3 | 11000010212210211020120110 |
4 | 100131202011211133322 |
5 | 122013220314432310 |
6 | 2223402022005150 |
7 | 144504510415020 |
oct | 20354205453772 |
9 | 4003783736513 |
10 | 1131222030330 |
11 | 3a6826388547 |
12 | 1632a3b767b6 |
13 | 8289b3a9132 |
14 | 3ca73d38710 |
15 | 1e65ba17d20 |
hex | 107621657fa |
1131222030330 has 64 divisors (see below), whose sum is σ = 3109946450688. Its totient is φ = 257967866880.
The previous prime is 1131222030283. The next prime is 1131222030331. The reversal of 1131222030330 is 330302221311.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1131222030297 and 1131222030306.
It is not an unprimeable number, because it can be changed into a prime (1131222030331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6129361 + ... + 6311220.
It is an arithmetic number, because the mean of its divisors is an integer number (48592913292).
Almost surely, 21131222030330 is an apocalyptic number.
1131222030330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1131222030330 is an abundant number, since it is smaller than the sum of its proper divisors (1978724420358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131222030330 is a wasteful number, since it uses less digits than its factorization.
1131222030330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12441031.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1131222030330 its reverse (330302221311), we get a palindrome (1461524251641).
The spelling of 1131222030330 in words is "one trillion, one hundred thirty-one billion, two hundred twenty-two million, thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •