Base | Representation |
---|---|
bin | 1010011010100010011100… |
… | …1011100011101010100111 |
3 | 1111112201010200021102112210 |
4 | 2212220213023203222213 |
5 | 3000103212234332411 |
6 | 40204311335214503 |
7 | 2261211310212021 |
oct | 246504713435247 |
9 | 44481120242483 |
10 | 11451040152231 |
11 | 37153a47020a9 |
12 | 134b356217433 |
13 | 650aa015a1b4 |
14 | 2b833a269011 |
15 | 14cd03e0aca6 |
hex | a6a272e3aa7 |
11451040152231 has 64 divisors (see below), whose sum is σ = 15720868800000. Its totient is φ = 7411515489792.
The previous prime is 11451040152199. The next prime is 11451040152407. The reversal of 11451040152231 is 13225104015411.
It is not a de Polignac number, because 11451040152231 - 25 = 11451040152199 is a prime.
It is a super-2 number, since 2×114510401522312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11451040157231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7392536445 + ... + 7392537993.
It is an arithmetic number, because the mean of its divisors is an integer number (245638575000).
Almost surely, 211451040152231 is an apocalyptic number.
11451040152231 is a deficient number, since it is larger than the sum of its proper divisors (4269828647769).
11451040152231 is a wasteful number, since it uses less digits than its factorization.
11451040152231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3136.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 11451040152231 its reverse (13225104015411), we get a palindrome (24676144167642).
The spelling of 11451040152231 in words is "eleven trillion, four hundred fifty-one billion, forty million, one hundred fifty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •