Base | Representation |
---|---|
bin | 111000001000001011… |
… | …0001011101111101101 |
3 | 102112010011201211121101 |
4 | 1300100112023233231 |
5 | 3433323013210041 |
6 | 131212223403101 |
7 | 11464633305001 |
oct | 1602026135755 |
9 | 375104654541 |
10 | 120533335021 |
11 | 47132a1a670 |
12 | 1b43a453491 |
13 | b49b841418 |
14 | 5b960d8701 |
15 | 3206c05b31 |
hex | 1c1058bbed |
120533335021 has 16 divisors (see below), whose sum is σ = 134352546048. Its totient is φ = 107193284800.
The previous prime is 120533335001. The next prime is 120533335033.
120533335021 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 120533335021 - 27 = 120533334893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120533335001) by changing a digit.
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, 1052451 + ... + 1161343.
It is an arithmetic number, because the mean of its divisors is an integer number (8397034128).
Almost surely, 2120533335021 is an apocalyptic number.
120533335021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120533335021 is a deficient number, since it is larger than the sum of its proper divisors (13819211027).
120533335021 is a wasteful number, since it uses less digits than its factorization.
120533335021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111092.
The product of its (nonzero) digits is 8100, while the sum is 28.
It can be divided in two parts, 120533 and 335021, that added together give a palindrome (455554).
The spelling of 120533335021 in words is "one hundred twenty billion, five hundred thirty-three million, three hundred thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •