Base | Representation |
---|---|
bin | 10111011111011001110000… |
… | …100001001111011100110011 |
3 | 111112210121222202211022102002 |
4 | 113133121300201033130303 |
5 | 102020140041430201321 |
6 | 1003421203513044215 |
7 | 30522056135636552 |
oct | 2737316041173463 |
9 | 445717882738362 |
10 | 103313031100211 |
11 | 2aa118a0766659 |
12 | b7069110b666b |
13 | 45854b944511a |
14 | 1b7253d78dd99 |
15 | be262071920b |
hex | 5df67084f733 |
103313031100211 has 8 divisors (see below), whose sum is σ = 103435845274944. Its totient is φ = 103190259248640.
The previous prime is 103313031100199. The next prime is 103313031100243. The reversal of 103313031100211 is 112001130313301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103313031100211 - 214 = 103313031083827 is a prime.
It is a super-2 number, since 2×1033130311002112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103313031100271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5694446 + ... + 15461331.
It is an arithmetic number, because the mean of its divisors is an integer number (12929480659368).
Almost surely, 2103313031100211 is an apocalyptic number.
103313031100211 is a deficient number, since it is larger than the sum of its proper divisors (122814174733).
103313031100211 is a wasteful number, since it uses less digits than its factorization.
103313031100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21161581.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 103313031100211 its reverse (112001130313301), we get a palindrome (215314161413512).
The spelling of 103313031100211 in words is "one hundred three trillion, three hundred thirteen billion, thirty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •