Base | Representation |
---|---|
bin | 1010010111010110010010… |
… | …0010010001000001011011 |
3 | 1111100110200012121012122100 |
4 | 2211311210202101001123 |
5 | 2443203442121044012 |
6 | 40123205201254443 |
7 | 2254231216461444 |
oct | 245654442210133 |
9 | 44313605535570 |
10 | 11396234940507 |
11 | 36a413058539a |
12 | 1340800034423 |
13 | 648877a0c931 |
14 | 2b581b6a02cb |
15 | 14b6977898dc |
hex | a5d6489105b |
11396234940507 has 24 divisors (see below), whose sum is σ = 16533282864384. Its totient is φ = 7564267078704.
The previous prime is 11396234940469. The next prime is 11396234940533. The reversal of 11396234940507 is 70504943269311.
11396234940507 is a `hidden beast` number, since 1 + 1 + 3 + 9 + 62 + 34 + 9 + 40 + 507 = 666.
It is not a de Polignac number, because 11396234940507 - 216 = 11396234874971 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11396234940547) 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, 2757178 + ... + 5513120.
It is an arithmetic number, because the mean of its divisors is an integer number (688886786016).
Almost surely, 211396234940507 is an apocalyptic number.
11396234940507 is a deficient number, since it is larger than the sum of its proper divisors (5137047923877).
11396234940507 is a wasteful number, since it uses less digits than its factorization.
11396234940507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2757959 (or 2757956 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 54.
Adding to 11396234940507 its sum of digits (54), we get a square (11396234940561 = 33758312).
The spelling of 11396234940507 in words is "eleven trillion, three hundred ninety-six billion, two hundred thirty-four million, nine hundred forty thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •