Base | Representation |
---|---|
bin | 10101110110111010… |
… | …10101000010100111 |
3 | 1010021211101212000221 |
4 | 22323131111002213 |
5 | 143013122243333 |
6 | 5220240545211 |
7 | 563542351126 |
oct | 127335250247 |
9 | 33254355027 |
10 | 11734962343 |
11 | 4a82097995 |
12 | 2336022207 |
13 | 1150288600 |
14 | 7d4749abd |
15 | 48a36ad2d |
hex | 2bb7550a7 |
11734962343 has 24 divisors (see below), whose sum is σ = 13687111680. Its totient is φ = 10023380640.
The previous prime is 11734962341. The next prime is 11734962373. The reversal of 11734962343 is 34326943711.
It is not a de Polignac number, because 11734962343 - 21 = 11734962341 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11734962343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11734962341) 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 23 ways as a sum of consecutive naturals, for example, 95578 + ... + 180568.
It is an arithmetic number, because the mean of its divisors is an integer number (570296320).
Almost surely, 211734962343 is an apocalyptic number.
11734962343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11734962343 is a deficient number, since it is larger than the sum of its proper divisors (1952149337).
11734962343 is a wasteful number, since it uses less digits than its factorization.
11734962343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85079 (or 85066 counting only the distinct ones).
The product of its digits is 326592, while the sum is 43.
The spelling of 11734962343 in words is "eleven billion, seven hundred thirty-four million, nine hundred sixty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •