Base | Representation |
---|---|
bin | 10111011011001010110101… |
… | …100101101101001011010001 |
3 | 111111202211010112002002221221 |
4 | 113123022311211231023101 |
5 | 102000403311310403241 |
6 | 1003035414130245041 |
7 | 30462050321265316 |
oct | 2733126545551321 |
9 | 444684115062857 |
10 | 103022132122321 |
11 | 2a90a49388aa35 |
12 | b67a467726781 |
13 | 4563c39ca75c9 |
14 | 1b6242523cd0d |
15 | bd9c9703e5d1 |
hex | 5db2b596d2d1 |
103022132122321 has 16 divisors (see below), whose sum is σ = 106768943424000. Its totient is φ = 99302568422400.
The previous prime is 103022132122307. The next prime is 103022132122339. The reversal of 103022132122321 is 123221231220301.
It is a cyclic number.
It is not a de Polignac number, because 103022132122321 - 25 = 103022132122289 is a prime.
It is a super-2 number, since 2×1030221321223212 (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 (103022132152321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1466535 + ... + 14428963.
It is an arithmetic number, because the mean of its divisors is an integer number (6673058964000).
Almost surely, 2103022132122321 is an apocalyptic number.
It is an amenable number.
103022132122321 is a deficient number, since it is larger than the sum of its proper divisors (3746811301679).
103022132122321 is a wasteful number, since it uses less digits than its factorization.
103022132122321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12963480.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 103022132122321 its reverse (123221231220301), we get a palindrome (226243363342622).
The spelling of 103022132122321 in words is "one hundred three trillion, twenty-two billion, one hundred thirty-two million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •