Base | Representation |
---|---|
bin | 1100101110010110100110… |
… | …1001101111000110001111 |
3 | 1211112110212200022020220010 |
4 | 3023211221221233012033 |
5 | 3313210001121002232 |
6 | 45431045510324303 |
7 | 2642531106431025 |
oct | 313455151570617 |
9 | 54473780266803 |
10 | 13990481031567 |
11 | 45043698a1827 |
12 | 169b547959693 |
13 | 7a63b1b09b51 |
14 | 365200164715 |
15 | 193dd03ad0cc |
hex | cb969a6f18f |
13990481031567 has 16 divisors (see below), whose sum is σ = 18812653786080. Its totient is φ = 9247970992512.
The previous prime is 13990481031539. The next prime is 13990481031619. The reversal of 13990481031567 is 76513018409931.
It is not a de Polignac number, because 13990481031567 - 211 = 13990481029519 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13990481031067) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40223692 + ... + 40570017.
It is an arithmetic number, because the mean of its divisors is an integer number (1175790861630).
Almost surely, 213990481031567 is an apocalyptic number.
13990481031567 is a deficient number, since it is larger than the sum of its proper divisors (4822172754513).
13990481031567 is a wasteful number, since it uses less digits than its factorization.
13990481031567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80794202.
The product of its (nonzero) digits is 4898880, while the sum is 57.
The spelling of 13990481031567 in words is "thirteen trillion, nine hundred ninety billion, four hundred eighty-one million, thirty-one thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •