Base | Representation |
---|---|
bin | 1011000011000000111000… |
… | …0000000111010000110111 |
3 | 1121000011222200001210222101 |
4 | 2300300032000013100313 |
5 | 3043001313010030423 |
6 | 41455551422042531 |
7 | 2362356114045421 |
oct | 260601600072067 |
9 | 47004880053871 |
10 | 12146402423863 |
11 | 396329556a834 |
12 | 1442079719447 |
13 | 6a152982a266 |
14 | 2ddc63651811 |
15 | 160e50c6b7ad |
hex | b0c0e007437 |
12146402423863 has 4 divisors (see below), whose sum is σ = 12146596912768. Its totient is φ = 12146207934960.
The previous prime is 12146402423861. The next prime is 12146402423929. The reversal of 12146402423863 is 36832420464121.
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 12146402423863 - 21 = 12146402423861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12146402423861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 97150743 + ... + 97275688.
It is an arithmetic number, because the mean of its divisors is an integer number (3036649228192).
Almost surely, 212146402423863 is an apocalyptic number.
12146402423863 is a deficient number, since it is larger than the sum of its proper divisors (194488905).
12146402423863 is an equidigital number, since it uses as much as digits as its factorization.
12146402423863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194488904.
The product of its (nonzero) digits is 1327104, while the sum is 46.
Adding to 12146402423863 its reverse (36832420464121), we get a palindrome (48978822887984).
The spelling of 12146402423863 in words is "twelve trillion, one hundred forty-six billion, four hundred two million, four hundred twenty-three thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •