Base | Representation |
---|---|
bin | 11001111100011001… |
… | …11110000110101111 |
3 | 1022221200220120110110 |
4 | 30332030332012233 |
5 | 212011143130031 |
6 | 10222035511103 |
7 | 1002106130535 |
oct | 147614760657 |
9 | 38850816413 |
10 | 13928489391 |
11 | 59a82a6263 |
12 | 2848758493 |
13 | 140c8618cb |
14 | 961bc0155 |
15 | 567c09c46 |
hex | 33e33e1af |
13928489391 has 32 divisors (see below), whose sum is σ = 19720960000. Its totient is φ = 8719796448.
The previous prime is 13928489389. The next prime is 13928489417. The reversal of 13928489391 is 19398482931.
It is not a de Polignac number, because 13928489391 - 21 = 13928489389 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13928489321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3207900 + ... + 3212238.
It is an arithmetic number, because the mean of its divisors is an integer number (616280000).
Almost surely, 213928489391 is an apocalyptic number.
13928489391 is a deficient number, since it is larger than the sum of its proper divisors (5792470609).
13928489391 is a wasteful number, since it uses less digits than its factorization.
13928489391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4843.
The product of its digits is 3359232, while the sum is 57.
The spelling of 13928489391 in words is "thirteen billion, nine hundred twenty-eight million, four hundred eighty-nine thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •