Base | Representation |
---|---|
bin | 1011000010110010111001… |
… | …1101011001101101010111 |
3 | 1120222211022021222210202201 |
4 | 2300230232131121231113 |
5 | 3042421122403131312 |
6 | 41454131325345331 |
7 | 2362164144031303 |
oct | 260545635315527 |
9 | 46884267883681 |
10 | 12142652005207 |
11 | 3961740553789 |
12 | 14413b1708247 |
13 | 6a107c832819 |
14 | 2dd9c9508d03 |
15 | 160cd1896557 |
hex | b0b2e759b57 |
12142652005207 has 4 divisors (see below), whose sum is σ = 12160694579440. Its totient is φ = 12124609430976.
The previous prime is 12142652005181. The next prime is 12142652005249. The reversal of 12142652005207 is 70250025624121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12142652005207 - 227 = 12142517787479 is a prime.
It is a super-2 number, since 2×121426520052072 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12142652005507) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9021286107 + ... + 9021287452.
It is an arithmetic number, because the mean of its divisors is an integer number (3040173644860).
Almost surely, 212142652005207 is an apocalyptic number.
12142652005207 is a deficient number, since it is larger than the sum of its proper divisors (18042574233).
12142652005207 is an equidigital number, since it uses as much as digits as its factorization.
12142652005207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18042574232.
The product of its (nonzero) digits is 67200, while the sum is 37.
Adding to 12142652005207 its reverse (70250025624121), we get a palindrome (82392677629328).
The spelling of 12142652005207 in words is "twelve trillion, one hundred forty-two billion, six hundred fifty-two million, five thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •