Base | Representation |
---|---|
bin | 11001111010010010… |
… | …10111011111100110 |
3 | 1022220110120012201110 |
4 | 30331021113133212 |
5 | 211442124030330 |
6 | 10220204005450 |
7 | 1001502400506 |
oct | 147511273746 |
9 | 38813505643 |
10 | 13910767590 |
11 | 59992a1645 |
12 | 2842830886 |
13 | 1408c98435 |
14 | 95d6c9a06 |
15 | 5663a8db0 |
hex | 33d2577e6 |
13910767590 has 64 divisors (see below), whose sum is σ = 33582951360. Its totient is φ = 3687690240.
The previous prime is 13910767579. The next prime is 13910767603. The reversal of 13910767590 is 9576701931.
13910767590 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6436110 + ... + 6438270.
It is an arithmetic number, because the mean of its divisors is an integer number (524733615).
Almost surely, 213910767590 is an apocalyptic number.
13910767590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13910767590 is an abundant number, since it is smaller than the sum of its proper divisors (19672183770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13910767590 is a wasteful number, since it uses less digits than its factorization.
13910767590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3337.
The product of its (nonzero) digits is 357210, while the sum is 48.
The spelling of 13910767590 in words is "thirteen billion, nine hundred ten million, seven hundred sixty-seven thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •