Base | Representation |
---|---|
bin | 110101000000001111011010… |
… | …010101101010011010001110 |
3 | 1010120101101102200200112002022 |
4 | 311000033122111222122032 |
5 | 221023310422323232342 |
6 | 2143442350111130142 |
7 | 100046600530544141 |
oct | 6500173225523216 |
9 | 1116341380615068 |
10 | 233113013102222 |
11 | 6830574571a510 |
12 | 2218aa44513952 |
13 | a00c602a49036 |
14 | 417ca31304058 |
15 | 1be3c0ee859d2 |
hex | d403da56a68e |
233113013102222 has 64 divisors (see below), whose sum is σ = 383080949821440. Its totient is φ = 105510627696000.
The previous prime is 233113013102201. The next prime is 233113013102323. The reversal of 233113013102222 is 222201310311332.
It is a junction number, because it is equal to n+sod(n) for n = 233113013102191 and 233113013102200.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 34787791472 + ... + 34787798172.
It is an arithmetic number, because the mean of its divisors is an integer number (5985639840960).
Almost surely, 2233113013102222 is an apocalyptic number.
233113013102222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
233113013102222 is a deficient number, since it is larger than the sum of its proper divisors (149967936719218).
233113013102222 is a wasteful number, since it uses less digits than its factorization.
233113013102222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13817.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 233113013102222 its reverse (222201310311332), we get a palindrome (455314323413554).
The spelling of 233113013102222 in words is "two hundred thirty-three trillion, one hundred thirteen billion, thirteen million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •