Base | Representation |
---|---|
bin | 110000000000101010… |
… | …0010111101011110011 |
3 | 100212010022100100020200 |
4 | 1200001110113223303 |
5 | 3142122420112321 |
6 | 115210351210243 |
7 | 10306642602243 |
oct | 1400124275363 |
9 | 325108310220 |
10 | 103101332211 |
11 | 3a7a8017979 |
12 | 17b94516983 |
13 | 99511b2c67 |
14 | 4dc0cc3b23 |
15 | 2a36647d26 |
hex | 1801517af3 |
103101332211 has 6 divisors (see below), whose sum is σ = 148924146540. Its totient is φ = 68734221468.
The previous prime is 103101332207. The next prime is 103101332227. The reversal of 103101332211 is 112233101301.
103101332211 is a `hidden beast` number, since 1 + 0 + 310 + 1 + 332 + 21 + 1 = 666.
It is not a de Polignac number, because 103101332211 - 22 = 103101332207 is a prime.
It is a super-2 number, since 2×1031013322112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103101332231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5727851781 + ... + 5727851798.
It is an arithmetic number, because the mean of its divisors is an integer number (24820691090).
Almost surely, 2103101332211 is an apocalyptic number.
103101332211 is a deficient number, since it is larger than the sum of its proper divisors (45822814329).
103101332211 is a wasteful number, since it uses less digits than its factorization.
103101332211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11455703585 (or 11455703582 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 103101332211 its reverse (112233101301), we get a palindrome (215334433512).
The spelling of 103101332211 in words is "one hundred three billion, one hundred one million, three hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •