Base | Representation |
---|---|
bin | 1010000001000110011101… |
… | …1011001100111110100010 |
3 | 1102222221010210002011021000 |
4 | 2200101213123030332202 |
5 | 2420423214010044414 |
6 | 35231435351412430 |
7 | 2214510651423501 |
oct | 240214733147642 |
9 | 42887123064230 |
10 | 11014031331234 |
11 | 356702a607828 |
12 | 129a714984116 |
13 | 61b807382b09 |
14 | 2a1120c86838 |
15 | 14177842ab09 |
hex | a04676ccfa2 |
11014031331234 has 32 divisors (see below), whose sum is σ = 24476771629440. Its totient is φ = 3671171809776.
The previous prime is 11014031331221. The next prime is 11014031331257. The reversal of 11014031331234 is 43213313041011.
11014031331234 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 4 + 0 + 313 + 312 + 34 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11014031331198 and 11014031331207.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3610734 + ... + 5921609.
It is an arithmetic number, because the mean of its divisors is an integer number (764899113420).
Almost surely, 211014031331234 is an apocalyptic number.
11014031331234 is an abundant number, since it is smaller than the sum of its proper divisors (13462740298206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014031331234 is a wasteful number, since it uses less digits than its factorization.
11014031331234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9553751 (or 9553745 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 11014031331234 its reverse (43213313041011), we get a palindrome (54227344372245).
The spelling of 11014031331234 in words is "eleven trillion, fourteen billion, thirty-one million, three hundred thirty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •