Base | Representation |
---|---|
bin | 11001000110110101… |
… | …10001101011110000 |
3 | 1021210101100102121120 |
4 | 30203122301223300 |
5 | 210101123424241 |
6 | 10105304222240 |
7 | 655011442503 |
oct | 144332615360 |
9 | 37711312546 |
10 | 13479123696 |
11 | 5797683155 |
12 | 274216a980 |
13 | 136a72784c |
14 | 91c24913a |
15 | 53d544666 |
hex | 3236b1af0 |
13479123696 has 40 divisors (see below), whose sum is σ = 34825260624. Its totient is φ = 4492500480.
The previous prime is 13479123689. The next prime is 13479123703. The reversal of 13479123696 is 69632197431.
13479123696 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13479123689) and next prime (13479123703).
It is a super-2 number, since 2×134791236962 (a number of 21 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, 696876 + ... + 715956.
Almost surely, 213479123696 is an apocalyptic number.
13479123696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13479123696 is an abundant number, since it is smaller than the sum of its proper divisors (21346136928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13479123696 is a wasteful number, since it uses less digits than its factorization.
13479123696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33809 (or 33803 counting only the distinct ones).
The product of its digits is 1469664, while the sum is 51.
The spelling of 13479123696 in words is "thirteen billion, four hundred seventy-nine million, one hundred twenty-three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •