Base | Representation |
---|---|
bin | 11001111100011001… |
… | …11011100000100001 |
3 | 1022221200220000212110 |
4 | 30332030323200201 |
5 | 212011142310003 |
6 | 10222035345533 |
7 | 1002106054530 |
oct | 147614734041 |
9 | 38850800773 |
10 | 13928478753 |
11 | 59a8299272 |
12 | 28487522a9 |
13 | 140c859b07 |
14 | 961bba317 |
15 | 567c06a03 |
hex | 33e33b821 |
13928478753 has 8 divisors (see below), whose sum is σ = 21224348608. Its totient is φ = 7959130704.
The previous prime is 13928478689. The next prime is 13928478763. The reversal of 13928478753 is 35787482931.
13928478753 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13928478753 - 26 = 13928478689 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13928478693 and 13928478702.
It is not an unprimeable number, because it can be changed into a prime (13928478763) 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 7 ways as a sum of consecutive naturals, for example, 331630426 + ... + 331630467.
It is an arithmetic number, because the mean of its divisors is an integer number (2653043576).
Almost surely, 213928478753 is an apocalyptic number.
It is an amenable number.
13928478753 is a deficient number, since it is larger than the sum of its proper divisors (7295869855).
13928478753 is an equidigital number, since it uses as much as digits as its factorization.
13928478753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663260903.
The product of its digits is 10160640, while the sum is 57.
The spelling of 13928478753 in words is "thirteen billion, nine hundred twenty-eight million, four hundred seventy-eight thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •