Base | Representation |
---|---|
bin | 10011010110101010001… |
… | …011011001111101100110 |
3 | 11201010221222122220211202 |
4 | 103112222023121331212 |
5 | 133242320000323420 |
6 | 2454554340002502 |
7 | 165042432364541 |
oct | 23265213317546 |
9 | 4633858586752 |
10 | 1330000011110 |
11 | 473060373601 |
12 | 19591a390432 |
13 | 985594945c4 |
14 | 4852d9d7858 |
15 | 248e2a52575 |
hex | 135aa2d9f66 |
1330000011110 has 8 divisors (see below), whose sum is σ = 2394000020016. Its totient is φ = 532000004440.
The previous prime is 1330000011049. The next prime is 1330000011163. The reversal of 1330000011110 is 111100000331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1330000011091 and 1330000011100.
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, 66500000546 + ... + 66500000565.
It is an arithmetic number, because the mean of its divisors is an integer number (299250002502).
Almost surely, 21330000011110 is an apocalyptic number.
1330000011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1330000011110 is a deficient number, since it is larger than the sum of its proper divisors (1064000008906).
1330000011110 is a wasteful number, since it uses less digits than its factorization.
1330000011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133000001118.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 1330000011110 its reverse (111100000331), we get a palindrome (1441100011441).
The spelling of 1330000011110 in words is "one trillion, three hundred thirty billion, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •