Base | Representation |
---|---|
bin | 11011010010100001011011… |
… | …100011101011111010110101 |
3 | 120201221210212021121122121220 |
4 | 123102201123203223322311 |
5 | 111212402132130413023 |
6 | 1103132250200500553 |
7 | 34165111006111200 |
oct | 3322413343537265 |
9 | 521853767548556 |
10 | 120020102201013 |
11 | 3527326a858383 |
12 | 1156484947a759 |
13 | 51c7b02038b81 |
14 | 218d00ab5a937 |
15 | dd1ee935d3e3 |
hex | 6d285b8ebeb5 |
120020102201013 has 48 divisors (see below), whose sum is σ = 189210219770880. Its totient is φ = 67456860912000.
The previous prime is 120020102200993. The next prime is 120020102201053. The reversal of 120020102201013 is 310102201020021.
It is not a de Polignac number, because 120020102201013 - 213 = 120020102192821 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 120020102200983 and 120020102201001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120020102201053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 397544523 + ... + 397846311.
It is an arithmetic number, because the mean of its divisors is an integer number (3941879578560).
Almost surely, 2120020102201013 is an apocalyptic number.
It is an amenable number.
120020102201013 is a deficient number, since it is larger than the sum of its proper divisors (69190117569867).
120020102201013 is a wasteful number, since it uses less digits than its factorization.
120020102201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346218 (or 346211 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 120020102201013 its reverse (310102201020021), we get a palindrome (430122303221034).
The spelling of 120020102201013 in words is "one hundred twenty trillion, twenty billion, one hundred two million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •