Base | Representation |
---|---|
bin | 11001111101011000… |
… | …10110100010101110 |
3 | 1022222021101112011211 |
4 | 30332230112202232 |
5 | 212020244402300 |
6 | 10222532105034 |
7 | 1002236062633 |
oct | 147654264256 |
9 | 38867345154 |
10 | 13936715950 |
11 | 5a01a04a73 |
12 | 284b46517a |
13 | 14114821b1 |
14 | 962d2218a |
15 | 5687d24ba |
hex | 33eb168ae |
13936715950 has 12 divisors (see below), whose sum is σ = 25922291760. Its totient is φ = 5574686360.
The previous prime is 13936715929. The next prime is 13936715993. The reversal of 13936715950 is 5951763931.
It is a junction number, because it is equal to n+sod(n) for n = 13936715894 and 13936715903.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 139367110 + ... + 139367209.
It is an arithmetic number, because the mean of its divisors is an integer number (2160190980).
Almost surely, 213936715950 is an apocalyptic number.
13936715950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13936715950 is a deficient number, since it is larger than the sum of its proper divisors (11985575810).
13936715950 is a wasteful number, since it uses less digits than its factorization.
13936715950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278734331 (or 278734326 counting only the distinct ones).
The product of its (nonzero) digits is 765450, while the sum is 49.
The spelling of 13936715950 in words is "thirteen billion, nine hundred thirty-six million, seven hundred fifteen thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •