Base | Representation |
---|---|
bin | 1111000111001000010001… |
… | …10100110001101111101010 |
3 | 11100122210020102220101012120 |
4 | 13203210020310301233222 |
5 | 13323421133331201442 |
6 | 154401443233452110 |
7 | 6666545026466613 |
oct | 743441064615752 |
9 | 140583212811176 |
10 | 33230310022122 |
11 | a651993771194 |
12 | 388830b711036 |
13 | 15707b294cb45 |
14 | 82c4d9a30c0a |
15 | 3c95e39094ec |
hex | 1e3908d31bea |
33230310022122 has 32 divisors (see below), whose sum is σ = 66549637309248. Its totient is φ = 11061935108736.
The previous prime is 33230310022093. The next prime is 33230310022177. The reversal of 33230310022122 is 22122001303233.
It is a super-2 number, since 2×332303100221222 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33230310022092 and 33230310022101.
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 15 ways as a sum of consecutive naturals, for example, 109272493 + ... + 109576175.
It is an arithmetic number, because the mean of its divisors is an integer number (2079676165914).
Almost surely, 233230310022122 is an apocalyptic number.
33230310022122 is an abundant number, since it is smaller than the sum of its proper divisors (33319327287126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33230310022122 is a wasteful number, since it uses less digits than its factorization.
33230310022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328054.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 33230310022122 its reverse (22122001303233), we get a palindrome (55352311325355).
The spelling of 33230310022122 in words is "thirty-three trillion, two hundred thirty billion, three hundred ten million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •