Base | Representation |
---|---|
bin | 10000011100100110100… |
… | …011110001100111001110 |
3 | 11000001022012120001122010 |
4 | 100130212203301213032 |
5 | 122004144131430220 |
6 | 2223114544002050 |
7 | 144440662430532 |
oct | 20344643614716 |
9 | 4001265501563 |
10 | 1130223311310 |
11 | 3a636365a125 |
12 | 163065600326 |
13 | 8276c4ca032 |
14 | 3c9bb441bc2 |
15 | 1e5ededb1e0 |
hex | 107268f19ce |
1130223311310 has 64 divisors (see below), whose sum is σ = 2843165380608. Its totient is φ = 286996030464.
The previous prime is 1130223311263. The next prime is 1130223311381. The reversal of 1130223311310 is 131133220311.
It is a happy number.
It is a super-2 number, since 2×11302233113102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3518787 + ... + 3826526.
It is an arithmetic number, because the mean of its divisors is an integer number (44424459072).
Almost surely, 21130223311310 is an apocalyptic number.
1130223311310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1130223311310 is an abundant number, since it is smaller than the sum of its proper divisors (1712942069298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130223311310 is a wasteful number, since it uses less digits than its factorization.
1130223311310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7345569.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1130223311310 its reverse (131133220311), we get a palindrome (1261356531621).
Subtracting from 1130223311310 its reverse (131133220311), we obtain a palindrome (999090090999).
The spelling of 1130223311310 in words is "one trillion, one hundred thirty billion, two hundred twenty-three million, three hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •