Base | Representation |
---|---|
bin | 10011000000010011000… |
… | …110010110101010100110 |
3 | 11121211222201111220201102 |
4 | 103000103012112222212 |
5 | 132344132031201130 |
6 | 2435544100400102 |
7 | 163232443003166 |
oct | 23002306265246 |
9 | 4554881456642 |
10 | 1305990490790 |
11 | 46395a648627 |
12 | 1911396a6032 |
13 | 96201213b4b |
14 | 472d30005a6 |
15 | 23e89cd0645 |
hex | 13013196aa6 |
1305990490790 has 16 divisors (see below), whose sum is σ = 2350872953712. Its totient is φ = 522376180704.
The previous prime is 1305990490787. The next prime is 1305990490823. The reversal of 1305990490790 is 970940995031.
It is a super-2 number, since 2×13059904907902 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2226464 + ... + 2751203.
It is an arithmetic number, because the mean of its divisors is an integer number (146929559607).
Almost surely, 21305990490790 is an apocalyptic number.
1305990490790 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1305990490790 is a deficient number, since it is larger than the sum of its proper divisors (1044882462922).
1305990490790 is a wasteful number, since it uses less digits than its factorization.
1305990490790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5003911.
The product of its (nonzero) digits is 2755620, while the sum is 56.
The spelling of 1305990490790 in words is "one trillion, three hundred five billion, nine hundred ninety million, four hundred ninety thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •