Base | Representation |
---|---|
bin | 10111011100110010010111… |
… | …101101100011100010011011 |
3 | 111112011110002000002002110011 |
4 | 113130302113231203202123 |
5 | 102004213444300410321 |
6 | 1003202441200102351 |
7 | 30503064213622426 |
oct | 2734622755434233 |
9 | 445143060062404 |
10 | 103133300013211 |
11 | 2a9526501a5826 |
12 | b697b116049b7 |
13 | 45715754359c0 |
14 | 1b6796d5949bd |
15 | bdcb0192dae1 |
hex | 5dcc97b6389b |
103133300013211 has 8 divisors (see below), whose sum is σ = 111238294827744. Its totient is φ = 95052828633600.
The previous prime is 103133300013173. The next prime is 103133300013221. The reversal of 103133300013211 is 112310003331301.
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 103133300013211 - 213 = 103133300005019 is a prime.
It is a super-2 number, since 2×1031333000132112 (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 (103133300013221) 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, 6130849990 + ... + 6130866811.
It is an arithmetic number, because the mean of its divisors is an integer number (13904786853468).
Almost surely, 2103133300013211 is an apocalyptic number.
103133300013211 is a deficient number, since it is larger than the sum of its proper divisors (8104994814533).
103133300013211 is a wasteful number, since it uses less digits than its factorization.
103133300013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12261717461.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 103133300013211 its reverse (112310003331301), we get a palindrome (215443303344512).
The spelling of 103133300013211 in words is "one hundred three trillion, one hundred thirty-three billion, three hundred million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •