Base | Representation |
---|---|
bin | 1101010111001010010000… |
… | …1000111010000010001001 |
3 | 1221000111102211002220221121 |
4 | 3111302210020322002021 |
5 | 3411201234214404401 |
6 | 51125111243035241 |
7 | 3044300051060665 |
oct | 325624410720211 |
9 | 57014384086847 |
10 | 14691541950601 |
11 | 475471447260a |
12 | 179339b80bb21 |
13 | 827538cc3319 |
14 | 38b1083138a5 |
15 | 1a726267bca1 |
hex | d5ca423a089 |
14691541950601 has 4 divisors (see below), whose sum is σ = 14705008076304. Its totient is φ = 14678075824900.
The previous prime is 14691541950581. The next prime is 14691541950647. The reversal of 14691541950601 is 10605914519641.
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 14691541950601 - 221 = 14691539853449 is a prime.
It is a super-2 number, since 2×146915419506012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14691541950691) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6733061215 + ... + 6733063396.
It is an arithmetic number, because the mean of its divisors is an integer number (3676252019076).
Almost surely, 214691541950601 is an apocalyptic number.
It is an amenable number.
14691541950601 is a deficient number, since it is larger than the sum of its proper divisors (13466125703).
14691541950601 is a wasteful number, since it uses less digits than its factorization.
14691541950601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13466125702.
The product of its (nonzero) digits is 1166400, while the sum is 52.
The spelling of 14691541950601 in words is "fourteen trillion, six hundred ninety-one billion, five hundred forty-one million, nine hundred fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •