Base | Representation |
---|---|
bin | 10111011011000001011011… |
… | …101001000111001011001011 |
3 | 111111201212001201001012120011 |
4 | 113123001123221013023023 |
5 | 102000222120440144321 |
6 | 1003031024050012351 |
7 | 30461242132262461 |
oct | 2733013351071313 |
9 | 444655051035504 |
10 | 103012033131211 |
11 | 2a906181203496 |
12 | b6785095770b7 |
13 | 4562cba93a919 |
14 | 1b61b47cac831 |
15 | bd98a562aae1 |
hex | 5db05ba472cb |
103012033131211 has 8 divisors (see below), whose sum is σ = 104032450522224. Its totient is φ = 101991625471200.
The previous prime is 103012033131131. The next prime is 103012033131229. The reversal of 103012033131211 is 112131330210301.
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 103012033131211 - 27 = 103012033131083 is a prime.
It is a super-2 number, since 2×1030120331312112 (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 (103012033131311) 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, 19849900 + ... + 24495766.
It is an arithmetic number, because the mean of its divisors is an integer number (13004056315278).
Almost surely, 2103012033131211 is an apocalyptic number.
103012033131211 is a deficient number, since it is larger than the sum of its proper divisors (1020417391013).
103012033131211 is a wasteful number, since it uses less digits than its factorization.
103012033131211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4865501.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 103012033131211 its reverse (112131330210301), we get a palindrome (215143363341512).
The spelling of 103012033131211 in words is "one hundred three trillion, twelve billion, thirty-three million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •