Base | Representation |
---|---|
bin | 10111011011001001111000… |
… | …110011011110010100110011 |
3 | 111111202201111110010211222220 |
4 | 113123021320303132110303 |
5 | 102000344214223240311 |
6 | 1003035125020332123 |
7 | 30462013126154511 |
oct | 2733117063362463 |
9 | 444681443124886 |
10 | 103021112321331 |
11 | 2a90a0101723a6 |
12 | b67a2220a4043 |
13 | 4563b06926779 |
14 | 1b62369a194b1 |
15 | bd9c3774b206 |
hex | 5db278cde533 |
103021112321331 has 8 divisors (see below), whose sum is σ = 141073955611344. Its totient is φ = 66824505289440.
The previous prime is 103021112321329. The next prime is 103021112321371. The reversal of 103021112321331 is 133123211120301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103021112321331 - 21 = 103021112321329 is a prime.
It is a super-2 number, since 2×1030211123213312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103021112321311) 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, 464059064400 + ... + 464059064621.
It is an arithmetic number, because the mean of its divisors is an integer number (17634244451418).
Almost surely, 2103021112321331 is an apocalyptic number.
103021112321331 is a deficient number, since it is larger than the sum of its proper divisors (38052843290013).
103021112321331 is an equidigital number, since it uses as much as digits as its factorization.
103021112321331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928118129061.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 103021112321331 its reverse (133123211120301), we get a palindrome (236144323441632).
The spelling of 103021112321331 in words is "one hundred three trillion, twenty-one billion, one hundred twelve million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •