Base | Representation |
---|---|
bin | 10101001000000111… |
… | …10111101010000111 |
3 | 1002021110202020210000 |
4 | 22210003313222013 |
5 | 141212124144143 |
6 | 5113255132343 |
7 | 551034625536 |
oct | 124403675207 |
9 | 32243666700 |
10 | 11342412423 |
11 | 48a0550371 |
12 | 22466740b3 |
13 | 10b9b55054 |
14 | 79856431d |
15 | 465b79bd3 |
hex | 2a40f7a87 |
11342412423 has 10 divisors (see below), whose sum is σ = 16943603864. Its totient is φ = 7561608228.
The previous prime is 11342412397. The next prime is 11342412437. The reversal of 11342412423 is 32421424311.
11342412423 is a `hidden beast` number, since 113 + 424 + 124 + 2 + 3 = 666.
11342412423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11342412423 - 25 = 11342412391 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11342412623) 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 9 ways as a sum of consecutive naturals, for example, 70014811 + ... + 70014972.
Almost surely, 211342412423 is an apocalyptic number.
11342412423 is a deficient number, since it is larger than the sum of its proper divisors (5601191441).
11342412423 is an equidigital number, since it uses as much as digits as its factorization.
11342412423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140029795 (or 140029786 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
Adding to 11342412423 its reverse (32421424311), we get a palindrome (43763836734).
The spelling of 11342412423 in words is "eleven billion, three hundred forty-two million, four hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •