Base | Representation |
---|---|
bin | 110000001110101001101000… |
… | …000001100110011010011010 |
3 | 1000211000210201200101112200100 |
4 | 300032221220001212122122 |
5 | 210300224411013131302 |
6 | 2031043211140320230 |
7 | 62451441610515003 |
oct | 6016515001463232 |
9 | 1024023650345610 |
10 | 212113000130202 |
11 | 61649688887506 |
12 | 1b958b066a3076 |
13 | 91482298a7222 |
14 | 3a544770241aa |
15 | 197c82c674d1c |
hex | c0ea6806669a |
212113000130202 has 24 divisors (see below), whose sum is σ = 459578470815360. Its totient is φ = 70704286628040.
The previous prime is 212113000130189. The next prime is 212113000130203. The reversal of 212113000130202 is 202031000311212.
212113000130202 is a `hidden beast` number, since 2 + 1 + 211 + 300 + 0 + 130 + 20 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (212113000130203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34099927 + ... + 39837557.
It is an arithmetic number, because the mean of its divisors is an integer number (19149102950640).
Almost surely, 2212113000130202 is an apocalyptic number.
212113000130202 is an abundant number, since it is smaller than the sum of its proper divisors (247465470685158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212113000130202 is a wasteful number, since it uses less digits than its factorization.
212113000130202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7791458 (or 7791455 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 212113000130202 its reverse (202031000311212), we get a palindrome (414144000441414).
The spelling of 212113000130202 in words is "two hundred twelve trillion, one hundred thirteen billion, one hundred thirty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •