Base | Representation |
---|---|
bin | 10011010110110000001… |
… | …100101001111110001000 |
3 | 11201011020000200210110112 |
4 | 103112300030221332020 |
5 | 133243021324031440 |
6 | 2455012344333452 |
7 | 165045066655142 |
oct | 23266014517610 |
9 | 4634200623415 |
10 | 1330101002120 |
11 | 473102381650 |
12 | 195948174288 |
13 | 985743941b7 |
14 | 4853d1a5c92 |
15 | 248eb850965 |
hex | 135b0329f88 |
1330101002120 has 64 divisors (see below), whose sum is σ = 3301476537600. Its totient is φ = 478238548480.
The previous prime is 1330101002071. The next prime is 1330101002147. The reversal of 1330101002120 is 212001010331.
It is a junction number, because it is equal to n+sod(n) for n = 1330101002095 and 1330101002104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16943744 + ... + 17022063.
It is an arithmetic number, because the mean of its divisors is an integer number (51585570900).
Almost surely, 21330101002120 is an apocalyptic number.
1330101002120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330101002120 is an abundant number, since it is smaller than the sum of its proper divisors (1971375535480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330101002120 is a wasteful number, since it uses less digits than its factorization.
1330101002120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33965918 (or 33965914 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1330101002120 its reverse (212001010331), we get a palindrome (1542102012451).
The spelling of 1330101002120 in words is "one trillion, three hundred thirty billion, one hundred one million, two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •