Base | Representation |
---|---|
bin | 1011000001011110100101… |
… | …1111001100010011100101 |
3 | 1120220122220000220100010220 |
4 | 2300113221133030103211 |
5 | 3042033300110311323 |
6 | 41435505455234553 |
7 | 2360433252165513 |
oct | 260275137142345 |
9 | 46818800810126 |
10 | 12120020010213 |
11 | 3953087366995 |
12 | 1438b36218a59 |
13 | 69bbb3a91bcb |
14 | 2dc87d8534b3 |
15 | 160409a2a0e3 |
hex | b05e97cc4e5 |
12120020010213 has 16 divisors (see below), whose sum is σ = 16254124755456. Its totient is φ = 8033017743360.
The previous prime is 12120020010187. The next prime is 12120020010269. The reversal of 12120020010213 is 31201002002121.
It is not a de Polignac number, because 12120020010213 - 237 = 11982581056741 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12120020010192 and 12120020010201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120020010013) by changing a digit.
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, 5771928 + ... + 7586513.
It is an arithmetic number, because the mean of its divisors is an integer number (1015882797216).
Almost surely, 212120020010213 is an apocalyptic number.
It is an amenable number.
12120020010213 is a deficient number, since it is larger than the sum of its proper divisors (4134104745243).
12120020010213 is a wasteful number, since it uses less digits than its factorization.
12120020010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13360204.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 12120020010213 its reverse (31201002002121), we get a palindrome (43321022012334).
The spelling of 12120020010213 in words is "twelve trillion, one hundred twenty billion, twenty million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •