Base | Representation |
---|---|
bin | 1010110100111001100000… |
… | …0110110110001111001010 |
3 | 1120011000001200211211012022 |
4 | 2231032120012312033022 |
5 | 3030013200003342231 |
6 | 41152325024444442 |
7 | 2336012616063122 |
oct | 255163006661712 |
9 | 46130050754168 |
10 | 11903906309066 |
11 | 387a466860602 |
12 | 1403082179722 |
13 | 6846c2289935 |
14 | 2d221b683c82 |
15 | 1599abb00c7b |
hex | ad3981b63ca |
11903906309066 has 8 divisors (see below), whose sum is σ = 17865907786020. Its totient is φ = 5948603713728.
The previous prime is 11903906309063. The next prime is 11903906309081. The reversal of 11903906309066 is 66090360930911.
11903906309066 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 11735043666025 + 168862643041 = 3425645^2 + 410929^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×119039063090662 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11903906308999 and 11903906309017.
It is not an unprimeable number, because it can be changed into a prime (11903906309063) 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, 1674715961 + ... + 1674723068.
Almost surely, 211903906309066 is an apocalyptic number.
11903906309066 is a deficient number, since it is larger than the sum of its proper divisors (5962001476954).
11903906309066 is a wasteful number, since it uses less digits than its factorization.
11903906309066 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3349440808.
The product of its (nonzero) digits is 1417176, while the sum is 53.
The spelling of 11903906309066 in words is "eleven trillion, nine hundred three billion, nine hundred six million, three hundred nine thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •