Base | Representation |
---|---|
bin | 1010011010100011100010… |
… | …0001001000010111000011 |
3 | 1111112201212221121001102112 |
4 | 2212220320201020113003 |
5 | 3000104311220121402 |
6 | 40204400245405535 |
7 | 2261221441435460 |
oct | 246507041102703 |
9 | 44481787531375 |
10 | 11451331020227 |
11 | 371553390957a |
12 | 134b4177098ab |
13 | 650b184ab537 |
14 | 2b8366b42667 |
15 | 14cd1e713e52 |
hex | a6a388485c3 |
11451331020227 has 32 divisors (see below), whose sum is σ = 13162038865920. Its totient is φ = 9759528773280.
The previous prime is 11451331020209. The next prime is 11451331020229. The reversal of 11451331020227 is 72202013315411.
It is a cyclic number.
It is not a de Polignac number, because 11451331020227 - 214 = 11451331003843 is a prime.
It is a super-2 number, since 2×114513310202272 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11451331020193 and 11451331020202.
It is not an unprimeable number, because it can be changed into a prime (11451331020229) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1381171952 + ... + 1381180242.
It is an arithmetic number, because the mean of its divisors is an integer number (411313714560).
Almost surely, 211451331020227 is an apocalyptic number.
11451331020227 is a deficient number, since it is larger than the sum of its proper divisors (1710707845693).
11451331020227 is a wasteful number, since it uses less digits than its factorization.
11451331020227 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10223.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 11451331020227 its reverse (72202013315411), we get a palindrome (83653344335638).
The spelling of 11451331020227 in words is "eleven trillion, four hundred fifty-one billion, three hundred thirty-one million, twenty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •