Base | Representation |
---|---|
bin | 1100101001111111010011… |
… | …0110011010000011111011 |
3 | 1211021022100121101120010011 |
4 | 3022133310312122003323 |
5 | 3310442424241144341 |
6 | 45332410132202351 |
7 | 2634235143445450 |
oct | 312376466320373 |
9 | 54238317346104 |
10 | 13915506974971 |
11 | 4485595a02388 |
12 | 1688b031693b7 |
13 | 79c2c4018354 |
14 | 36172aac1827 |
15 | 191e9326cb81 |
hex | ca7f4d9a0fb |
13915506974971 has 8 divisors (see below), whose sum is σ = 15947735811840. Its totient is φ = 11894352955368.
The previous prime is 13915506974927. The next prime is 13915506975037. The reversal of 13915506974971 is 17947960551931.
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 13915506974971 - 215 = 13915506942203 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13915506974897 and 13915506974906.
It is not an unprimeable number, because it can be changed into a prime (13915506972971) 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, 2768701621 + ... + 2768706646.
It is an arithmetic number, because the mean of its divisors is an integer number (1993466976480).
Almost surely, 213915506974971 is an apocalyptic number.
13915506974971 is a deficient number, since it is larger than the sum of its proper divisors (2032228836869).
13915506974971 is an equidigital number, since it uses as much as digits as its factorization.
13915506974971 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5537408633.
The product of its (nonzero) digits is 64297800, while the sum is 67.
The spelling of 13915506974971 in words is "thirteen trillion, nine hundred fifteen billion, five hundred six million, nine hundred seventy-four thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •