Base | Representation |
---|---|
bin | 10111001111101011111001… |
… | …101010011001111001110010 |
3 | 111101222101020120012001102120 |
4 | 113033223321222121321302 |
5 | 101344441141024103242 |
6 | 1001233105243055110 |
7 | 30351043022643114 |
oct | 2717537152317162 |
9 | 441871216161376 |
10 | 102233000222322 |
11 | 2a635854464672 |
12 | b571534b11496 |
13 | 45076b8823048 |
14 | 1b361644513b4 |
15 | bc44ace351ec |
hex | 5cfaf9a99e72 |
102233000222322 has 64 divisors (see below), whose sum is σ = 208072475854848. Its totient is φ = 33480049680000.
The previous prime is 102233000222321. The next prime is 102233000222371. The reversal of 102233000222322 is 223222000332201.
It is a junction number, because it is equal to n+sod(n) for n = 102233000222292 and 102233000222301.
It is not an unprimeable number, because it can be changed into a prime (102233000222321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 294105822 + ... + 294453222.
It is an arithmetic number, because the mean of its divisors is an integer number (3251132435232).
Almost surely, 2102233000222322 is an apocalyptic number.
102233000222322 is an abundant number, since it is smaller than the sum of its proper divisors (105839475632526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102233000222322 is a wasteful number, since it uses less digits than its factorization.
102233000222322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349895.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 102233000222322 its reverse (223222000332201), we get a palindrome (325455000554523).
The spelling of 102233000222322 in words is "one hundred two trillion, two hundred thirty-three billion, two hundred twenty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •