Base | Representation |
---|---|
bin | 10111011010110111010001… |
… | …001100000101111000001010 |
3 | 111111200210220011200122010120 |
4 | 113122313101030011320022 |
5 | 102000032243301131242 |
6 | 1003022021134524110 |
7 | 30460404532110261 |
oct | 2732672114057012 |
9 | 444623804618116 |
10 | 103001120333322 |
11 | 2a901591215962 |
12 | b676382966636 |
13 | 4561c6bac5873 |
14 | 1b613d081b5d8 |
15 | bd94675641ec |
hex | 5dadd1305e0a |
103001120333322 has 32 divisors (see below), whose sum is σ = 206848958553600. Its totient is φ = 34192873089648.
The previous prime is 103001120333317. The next prime is 103001120333323. The reversal of 103001120333322 is 223333021100301.
It is a junction number, because it is equal to n+sod(n) for n = 103001120333292 and 103001120333301.
It is not an unprimeable number, because it can be changed into a prime (103001120333323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34303672 + ... + 37185267.
It is an arithmetic number, because the mean of its divisors is an integer number (6464029954800).
Almost surely, 2103001120333322 is an apocalyptic number.
103001120333322 is an abundant number, since it is smaller than the sum of its proper divisors (103847838220278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103001120333322 is a wasteful number, since it uses less digits than its factorization.
103001120333322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71489930.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 103001120333322 its reverse (223333021100301), we get a palindrome (326334141433623).
The spelling of 103001120333322 in words is "one hundred three trillion, one billion, one hundred twenty million, three hundred thirty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •