Base | Representation |
---|---|
bin | 101011101111100110100… |
… | …0111011001101001000111 |
3 | 210021202021121210110212011 |
4 | 1113133031013121221013 |
5 | 1242000240213011143 |
6 | 20441530523035051 |
7 | 1160234312130541 |
oct | 127371507315107 |
9 | 23252247713764 |
10 | 6012100516423 |
11 | 1a08799008551 |
12 | 81122836ba87 |
13 | 347c282891a1 |
14 | 16adb6cd4691 |
15 | a65c6460e9d |
hex | 577cd1d9a47 |
6012100516423 has 4 divisors (see below), whose sum is σ = 6084535462488. Its totient is φ = 5939665570360.
The previous prime is 6012100516393. The next prime is 6012100516441. The reversal of 6012100516423 is 3246150012106.
It is a happy number.
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 6012100516423 - 229 = 6011563645511 is a prime.
It is a super-2 number, since 2×60121005164232 (a number of 26 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 (6012100516463) 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, 36217472908 + ... + 36217473073.
It is an arithmetic number, because the mean of its divisors is an integer number (1521133865622).
Almost surely, 26012100516423 is an apocalyptic number.
6012100516423 is a deficient number, since it is larger than the sum of its proper divisors (72434946065).
6012100516423 is an equidigital number, since it uses as much as digits as its factorization.
6012100516423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72434946064.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 6012100516423 its reverse (3246150012106), we get a palindrome (9258250528529).
The spelling of 6012100516423 in words is "six trillion, twelve billion, one hundred million, five hundred sixteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •