Base | Representation |
---|---|
bin | 11010000100010101… |
… | …01010111100001101 |
3 | 1100010100001102122112 |
4 | 31002022222330031 |
5 | 212130204323334 |
6 | 10232413153405 |
7 | 1003544333030 |
oct | 150212527415 |
9 | 40110042575 |
10 | 13994995469 |
11 | 5a318a0264 |
12 | 2866a8b865 |
13 | 1420579010 |
14 | 96a973017 |
15 | 56d9954ce |
hex | 3422aaf0d |
13994995469 has 8 divisors (see below), whose sum is σ = 17224609920. Its totient is φ = 11072963376.
The previous prime is 13994995463. The next prime is 13994995481. The reversal of 13994995469 is 96459949931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13994995469 - 28 = 13994995213 is a prime.
It is a super-2 number, since 2×139949954692 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13994995399 and 13994995408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13994995463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76895489 + ... + 76895670.
It is an arithmetic number, because the mean of its divisors is an integer number (2153076240).
Almost surely, 213994995469 is an apocalyptic number.
It is an amenable number.
13994995469 is a deficient number, since it is larger than the sum of its proper divisors (3229614451).
13994995469 is a wasteful number, since it uses less digits than its factorization.
13994995469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153791179.
The product of its digits is 85030560, while the sum is 68.
The spelling of 13994995469 in words is "thirteen billion, nine hundred ninety-four million, nine hundred ninety-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •