Base | Representation |
---|---|
bin | 1001000111110100110010… |
… | …0000011111011110011111 |
3 | 1022111212021012011012122000 |
4 | 2101331030200133132133 |
5 | 2303313001222101421 |
6 | 33155422211453343 |
7 | 2053434356125206 |
oct | 221751440373637 |
9 | 38455235135560 |
10 | 10030032222111 |
11 | 3217792785aa0 |
12 | 115ba795b7253 |
13 | 579a9c0c2b55 |
14 | 26965596423d |
15 | 125d867d4226 |
hex | 91f4c81f79f |
10030032222111 has 32 divisors (see below), whose sum is σ = 16210337587200. Its totient is φ = 6078738219840.
The previous prime is 10030032222071. The next prime is 10030032222143. The reversal of 10030032222111 is 11122223003001.
10030032222111 is a `hidden beast` number, since 1 + 0 + 0 + 300 + 32 + 222 + 111 = 666.
It is not a de Polignac number, because 10030032222111 - 213 = 10030032213919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030032222181) 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, 40246690 + ... + 40495136.
It is an arithmetic number, because the mean of its divisors is an integer number (506573049600).
Almost surely, 210030032222111 is an apocalyptic number.
10030032222111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10030032222111 is a deficient number, since it is larger than the sum of its proper divisors (6180305365089).
10030032222111 is a wasteful number, since it uses less digits than its factorization.
10030032222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384396 (or 384390 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10030032222111 its reverse (11122223003001), we get a palindrome (21152255225112).
The spelling of 10030032222111 in words is "ten trillion, thirty billion, thirty-two million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •