Base | Representation |
---|---|
bin | 11110110110100001101… |
… | …000100110000111111111 |
3 | 21111200102112212012102111 |
4 | 132312201220212013333 |
5 | 234214011421304443 |
6 | 4301550301434451 |
7 | 306113546121046 |
oct | 36664150460777 |
9 | 7450375765374 |
10 | 2120130650623 |
11 | 748162531727 |
12 | 2a2a8b56ba27 |
13 | 124c098343ab |
14 | 748872c555d |
15 | 3a23968e69d |
hex | 1eda1a261ff |
2120130650623 has 8 divisors (see below), whose sum is σ = 2231767296000. Its totient is φ = 2008499087448.
The previous prime is 2120130650587. The next prime is 2120130650647. The reversal of 2120130650623 is 3260560310212.
It is a happy number.
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 2120130650623 - 29 = 2120130650111 is a prime.
It is a super-2 number, since 2×21201306506232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120130650723) 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, 398911 + ... + 2097472.
It is an arithmetic number, because the mean of its divisors is an integer number (278970912000).
Almost surely, 22120130650623 is an apocalyptic number.
2120130650623 is a deficient number, since it is larger than the sum of its proper divisors (111636645377).
2120130650623 is a wasteful number, since it uses less digits than its factorization.
2120130650623 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2541101.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 2120130650623 its reverse (3260560310212), we get a palindrome (5380690960835).
The spelling of 2120130650623 in words is "two trillion, one hundred twenty billion, one hundred thirty million, six hundred fifty thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •