Base | Representation |
---|---|
bin | 1010000010111010011011… |
… | …1110001010010011111010 |
3 | 1110002220111100100201111220 |
4 | 2200232212332022103322 |
5 | 2421430443012343114 |
6 | 35254024422532510 |
7 | 2216662262622351 |
oct | 240564676122372 |
9 | 43086440321456 |
10 | 11045162231034 |
11 | 3579255150598 |
12 | 12a4762597136 |
13 | 621728b27299 |
14 | 2a2835594998 |
15 | 14249b4910a9 |
hex | a0ba6f8a4fa |
11045162231034 has 48 divisors (see below), whose sum is σ = 22550024818272. Its totient is φ = 3606632961984.
The previous prime is 11045162231029. The next prime is 11045162231057. The reversal of 11045162231034 is 43013226154011.
It is a super-3 number, since 3×110451622310343 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11045162230986 and 11045162231004.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 10327524 + ... + 11346720.
It is an arithmetic number, because the mean of its divisors is an integer number (469792183714).
Almost surely, 211045162231034 is an apocalyptic number.
11045162231034 is an abundant number, since it is smaller than the sum of its proper divisors (11504862587238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11045162231034 is a wasteful number, since it uses less digits than its factorization.
11045162231034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019951 (or 1019898 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
Adding to 11045162231034 its reverse (43013226154011), we get a palindrome (54058388385045).
The spelling of 11045162231034 in words is "eleven trillion, forty-five billion, one hundred sixty-two million, two hundred thirty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •