Base | Representation |
---|---|
bin | 1010000001010111… |
… | …1111110000011101 |
3 | 20221110221021220020 |
4 | 2200111333300131 |
5 | 21002132330413 |
6 | 1122534342353 |
7 | 123443435406 |
oct | 24025776035 |
9 | 6843837806 |
10 | 2690120733 |
11 | 1160559583 |
12 | 630aba9b9 |
13 | 33b437b21 |
14 | 1b73c09ad |
15 | 10b282c23 |
hex | a057fc1d |
2690120733 has 16 divisors (see below), whose sum is σ = 3744830976. Its totient is φ = 1714497840.
The previous prime is 2690120729. The next prime is 2690120767. The reversal of 2690120733 is 3370210962.
It is a happy number.
It is not a de Polignac number, because 2690120733 - 22 = 2690120729 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2690120694 and 2690120703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2690120723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129066 + ... + 148452.
It is an arithmetic number, because the mean of its divisors is an integer number (234051936).
Almost surely, 22690120733 is an apocalyptic number.
2690120733 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2690120733 is a deficient number, since it is larger than the sum of its proper divisors (1054710243).
2690120733 is a wasteful number, since it uses less digits than its factorization.
2690120733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21424.
The product of its (nonzero) digits is 13608, while the sum is 33.
The square root of 2690120733 is about 51866.3738177251. The cubic root of 2690120733 is about 1390.7762227656.
The spelling of 2690120733 in words is "two billion, six hundred ninety million, one hundred twenty thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •