Base | Representation |
---|---|
bin | 110111111000110111… |
… | …1111110001000110010 |
3 | 102110210101210210011110 |
4 | 1233301233332020302 |
5 | 3431300110020310 |
6 | 131045245054150 |
7 | 11446131115215 |
oct | 1576157761062 |
9 | 373711723143 |
10 | 120020001330 |
11 | 4699a186449 |
12 | 1b316557356 |
13 | b41939b288 |
14 | 5b47c7177c |
15 | 31c6b06d20 |
hex | 1bf1bfe232 |
120020001330 has 32 divisors (see below), whose sum is σ = 289639441728. Its totient is φ = 31828507200.
The previous prime is 120020001323. The next prime is 120020001337. The reversal of 120020001330 is 33100020021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (120020001323) and next prime (120020001337).
It is not an unprimeable number, because it can be changed into a prime (120020001337) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 11046136 + ... + 11056995.
It is an arithmetic number, because the mean of its divisors is an integer number (9051232554).
Almost surely, 2120020001330 is an apocalyptic number.
120020001330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120020001330 is an abundant number, since it is smaller than the sum of its proper divisors (169619440398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120020001330 is a wasteful number, since it uses less digits than its factorization.
120020001330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22103322.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 120020001330 its reverse (33100020021), we get a palindrome (153120021351).
The spelling of 120020001330 in words is "one hundred twenty billion, twenty million, one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •