Base | Representation |
---|---|
bin | 10111001111011000101001… |
… | …110011010010111100011000 |
3 | 111101220101220020012112202211 |
4 | 113033120221303102330120 |
5 | 101344121324223214000 |
6 | 1001215410401204504 |
7 | 30346411616436514 |
oct | 2717305163227430 |
9 | 441811806175684 |
10 | 102212333023000 |
11 | 2a628009359952 |
12 | b569527630734 |
13 | 4505773b51a15 |
14 | 1b351636cd144 |
15 | bc3b9d8257ba |
hex | 5cf629cd2f18 |
102212333023000 has 64 divisors (see below), whose sum is σ = 246892241905920. Its totient is φ = 39566064384000.
The previous prime is 102212333022953. The next prime is 102212333023061. The reversal of 102212333023000 is 320333212201.
It is a super-2 number, since 2×1022123330230002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1648555017 + ... + 1648617016.
It is an arithmetic number, because the mean of its divisors is an integer number (3857691279780).
Almost surely, 2102212333023000 is an apocalyptic number.
102212333023000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102212333023000 is an abundant number, since it is smaller than the sum of its proper divisors (144679908882920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212333023000 is a wasteful number, since it uses less digits than its factorization.
102212333023000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3297172085 (or 3297172071 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 102212333023000 its reverse (320333212201), we get a palindrome (102532666235201).
The spelling of 102212333023000 in words is "one hundred two trillion, two hundred twelve billion, three hundred thirty-three million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •