Base | Representation |
---|---|
bin | 111011111101110… |
… | …1101001100100001 |
3 | 12012020012022121121 |
4 | 1313323231030201 |
5 | 13110101442241 |
6 | 531355052241 |
7 | 100601624212 |
oct | 16773551441 |
9 | 5166168547 |
10 | 2012140321 |
11 | 942889894 |
12 | 481a41081 |
13 | 260b38199 |
14 | 151339409 |
15 | bb9aead1 |
hex | 77eed321 |
2012140321 has 8 divisors (see below), whose sum is σ = 2088313920. Its totient is φ = 1936419408.
The previous prime is 2012140279. The next prime is 2012140357. The reversal of 2012140321 is 1230412102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2012140321 - 229 = 1475269409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2012140295 and 2012140304.
It is not an unprimeable number, because it can be changed into a prime (2012140021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104101 + ... + 121906.
It is an arithmetic number, because the mean of its divisors is an integer number (261039240).
Almost surely, 22012140321 is an apocalyptic number.
It is an amenable number.
2012140321 is a deficient number, since it is larger than the sum of its proper divisors (76173599).
2012140321 is a wasteful number, since it uses less digits than its factorization.
2012140321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226343.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 2012140321 is about 44856.8871077787. The cubic root of 2012140321 is about 1262.4652166478.
Adding to 2012140321 its reverse (1230412102), we get a palindrome (3242552423).
The spelling of 2012140321 in words is "two billion, twelve million, one hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •