Base | Representation |
---|---|
bin | 1010011010100000000101… |
… | …0110011100100000111001 |
3 | 1111112122111110000100101011 |
4 | 2212220001112130200321 |
5 | 3000100412300103223 |
6 | 40204124343553521 |
7 | 2261156502423163 |
oct | 246500126344071 |
9 | 44478443010334 |
10 | 11450405472313 |
11 | 37150a9417745 |
12 | 134b1b975b8a1 |
13 | 6509cb80b452 |
14 | 2b82b9c55933 |
15 | 14ccb833c80d |
hex | a6a0159c839 |
11450405472313 has 8 divisors (see below), whose sum is σ = 11479521828096. Its totient is φ = 11421291912000.
The previous prime is 11450405472227. The next prime is 11450405472323. The reversal of 11450405472313 is 31327450405411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11450405472313 - 241 = 9251382216761 is a prime.
It is a super-2 number, since 2×114504054723132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11450405472323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7629648 + ... + 9006238.
It is an arithmetic number, because the mean of its divisors is an integer number (1434940228512).
Almost surely, 211450405472313 is an apocalyptic number.
It is an amenable number.
11450405472313 is a deficient number, since it is larger than the sum of its proper divisors (29116355783).
11450405472313 is a wasteful number, since it uses less digits than its factorization.
11450405472313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1397735.
The product of its (nonzero) digits is 201600, while the sum is 40.
Adding to 11450405472313 its reverse (31327450405411), we get a palindrome (42777855877724).
The spelling of 11450405472313 in words is "eleven trillion, four hundred fifty billion, four hundred five million, four hundred seventy-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •