Base | Representation |
---|---|
bin | 11001111000101001… |
… | …00110100110111101 |
3 | 1022212111112111011111 |
4 | 30330110212212331 |
5 | 211430103421434 |
6 | 10214551322021 |
7 | 1001244002005 |
oct | 147424464675 |
9 | 38774474144 |
10 | 13896935869 |
11 | 5991504673 |
12 | 283a080311 |
13 | 140616479b |
14 | 95b929005 |
15 | 565075964 |
hex | 33c5269bd |
13896935869 has 4 divisors (see below), whose sum is σ = 14501150496. Its totient is φ = 13292721244.
The previous prime is 13896935813. The next prime is 13896935887. The reversal of 13896935869 is 96853969831.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13896935869 - 29 = 13896935357 is a prime.
It is a super-2 number, since 2×138969358692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13896935069) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 302107279 + ... + 302107324.
It is an arithmetic number, because the mean of its divisors is an integer number (3625287624).
Almost surely, 213896935869 is an apocalyptic number.
It is an amenable number.
13896935869 is a deficient number, since it is larger than the sum of its proper divisors (604214627).
13896935869 is an equidigital number, since it uses as much as digits as its factorization.
13896935869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604214626.
The product of its digits is 75582720, while the sum is 67.
The spelling of 13896935869 in words is "thirteen billion, eight hundred ninety-six million, nine hundred thirty-five thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •