Base | Representation |
---|---|
bin | 110111111000111000… |
… | …0010110101101110001 |
3 | 102110210101222220021000 |
4 | 1233301300112231301 |
5 | 3431300121231001 |
6 | 131045251152213 |
7 | 11446132014552 |
oct | 1576160265561 |
9 | 373711886230 |
10 | 120020102001 |
11 | 4699a245048 |
12 | 1b3165a5669 |
13 | b419405047 |
14 | 5b47c9a329 |
15 | 31c6b26a86 |
hex | 1bf1c16b71 |
120020102001 has 32 divisors (see below), whose sum is σ = 182906841600. Its totient is φ = 77735064960.
The previous prime is 120020101991. The next prime is 120020102011. The reversal of 120020102001 is 100201020021.
It is an interprime number because it is at equal distance from previous prime (120020101991) and next prime (120020102011).
It is not a de Polignac number, because 120020102001 - 217 = 120019970929 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (120020102011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37755 + ... + 491391.
It is an arithmetic number, because the mean of its divisors is an integer number (5715838800).
Almost surely, 2120020102001 is an apocalyptic number.
It is an amenable number.
120020102001 is a deficient number, since it is larger than the sum of its proper divisors (62886739599).
120020102001 is a wasteful number, since it uses less digits than its factorization.
120020102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453926 (or 453920 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 120020102001 its reverse (100201020021), we get a palindrome (220221122022).
It can be divided in two parts, 1 and 20020102001, that added together give a palindrome (20020102002).
The spelling of 120020102001 in words is "one hundred twenty billion, twenty million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •