Base | Representation |
---|---|
bin | 11011010010011000000111… |
… | …011000101101001111101000 |
3 | 120201220212001012220101100202 |
4 | 123102120013120231033220 |
5 | 111212221141111231440 |
6 | 1103123513501051332 |
7 | 34164305104505054 |
oct | 3322300730551750 |
9 | 521825035811322 |
10 | 120010100102120 |
11 | 35269aa793a448 |
12 | 11562917856b48 |
13 | 51c6b99a95267 |
14 | 218c73c60cc64 |
15 | dd1b111d8615 |
hex | 6d260762d3e8 |
120010100102120 has 64 divisors (see below), whose sum is σ = 272503440594000. Its totient is φ = 47563035107328.
The previous prime is 120010100102119. The next prime is 120010100102153. The reversal of 120010100102120 is 21201001010021.
It can be written as a sum of positive squares in 8 ways, for example, as 65400571791844 + 54609528310276 = 8087062^2 + 7389826^2 .
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 15 ways as a sum of consecutive naturals, for example, 531166136 + ... + 531392024.
Almost surely, 2120010100102120 is an apocalyptic number.
120010100102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120010100102120 is an abundant number, since it is smaller than the sum of its proper divisors (152493340491880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120010100102120 is a wasteful number, since it uses less digits than its factorization.
120010100102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347862 (or 347858 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120010100102120 its reverse (21201001010021), we get a palindrome (141211101112141).
The spelling of 120010100102120 in words is "one hundred twenty trillion, ten billion, one hundred million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •