Base | Representation |
---|---|
bin | 110111111011010110… |
… | …1011101111000101101 |
3 | 102111000012102021211121 |
4 | 1233312231131320231 |
5 | 3431432411343041 |
6 | 131101421020541 |
7 | 11451161422324 |
oct | 1576655357055 |
9 | 374005367747 |
10 | 120103231021 |
11 | 46a32163114 |
12 | 1b33a3b4751 |
13 | b4306bc707 |
14 | 5b54d390bb |
15 | 31ce0977d1 |
hex | 1bf6b5de2d |
120103231021 has 8 divisors (see below), whose sum is σ = 121232933280. Its totient is φ = 118973663088.
The previous prime is 120103230991. The next prime is 120103231033. The reversal of 120103231021 is 120132301021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120103231021 - 27 = 120103230893 is a prime.
It is a super-2 number, since 2×1201032310212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120103230986 and 120103231004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120103231051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3431950 + ... + 3466768.
It is an arithmetic number, because the mean of its divisors is an integer number (15154116660).
Almost surely, 2120103231021 is an apocalyptic number.
It is an amenable number.
120103231021 is a deficient number, since it is larger than the sum of its proper divisors (1129702259).
120103231021 is a wasteful number, since it uses less digits than its factorization.
120103231021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67163.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 120103231021 its reverse (120132301021), we get a palindrome (240235532042).
The spelling of 120103231021 in words is "one hundred twenty billion, one hundred three million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •