Base | Representation |
---|---|
bin | 11001111001101110… |
… | …10110111111111000 |
3 | 1022220010200101020121 |
4 | 30330313112333320 |
5 | 211434422000333 |
6 | 10215514503024 |
7 | 1001414306662 |
oct | 147467267770 |
9 | 38803611217 |
10 | 13906046968 |
11 | 5996667a00 |
12 | 2841134a74 |
13 | 1408004878 |
14 | 95cc1b532 |
15 | 565c7532d |
hex | 33cdd6ff8 |
13906046968 has 48 divisors (see below), whose sum is σ = 28684572840. Its totient is φ = 6315439680.
The previous prime is 13906046899. The next prime is 13906046977. The reversal of 13906046968 is 86964060931.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1236346 + ... + 1247542.
Almost surely, 213906046968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13906046968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14342286420).
13906046968 is an abundant number, since it is smaller than the sum of its proper divisors (14778525872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13906046968 is a wasteful number, since it uses less digits than its factorization.
13906046968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12508 (or 12493 counting only the distinct ones).
The product of its (nonzero) digits is 1679616, while the sum is 52.
The spelling of 13906046968 in words is "thirteen billion, nine hundred six million, forty-six thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •