Base | Representation |
---|---|
bin | 1010000001000110011101… |
… | …1011001100111111100110 |
3 | 1102222221010210002011100112 |
4 | 2200101213123030333212 |
5 | 2420423214010100202 |
6 | 35231435351413022 |
7 | 2214510651423626 |
oct | 240214733147746 |
9 | 42887123064315 |
10 | 11014031331302 |
11 | 356702a60788a |
12 | 129a714984172 |
13 | 61b807382b5c |
14 | 2a1120c86886 |
15 | 14177842ab52 |
hex | a04676ccfe6 |
11014031331302 has 8 divisors (see below), whose sum is σ = 17090738272800. Its totient is φ = 5317118573704.
The previous prime is 11014031331271. The next prime is 11014031331343. The reversal of 11014031331302 is 20313313041011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×110140313313024 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 94948545902 + ... + 94948546017.
It is an arithmetic number, because the mean of its divisors is an integer number (2136342284100).
Almost surely, 211014031331302 is an apocalyptic number.
11014031331302 is a deficient number, since it is larger than the sum of its proper divisors (6076706941498).
11014031331302 is a wasteful number, since it uses less digits than its factorization.
11014031331302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189897091950.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11014031331302 its reverse (20313313041011), we get a palindrome (31327344372313).
The spelling of 11014031331302 in words is "eleven trillion, fourteen billion, thirty-one million, three hundred thirty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •