Base | Representation |
---|---|
bin | 1101101100101100001011… |
… | …0110101101101101000101 |
3 | 1222022212011120022101102010 |
4 | 3123023002312231231011 |
5 | 3433231244130301121 |
6 | 52011042313004433 |
7 | 3113103065413503 |
oct | 333130266555505 |
9 | 58285146271363 |
10 | 15061424462661 |
11 | 4887572505505 |
12 | 18330086b3719 |
13 | 853394b11b85 |
14 | 3a0d96607673 |
15 | 1b1baee90376 |
hex | db2c2dadb45 |
15061424462661 has 4 divisors (see below), whose sum is σ = 20081899283552. Its totient is φ = 10040949641772.
The previous prime is 15061424462621. The next prime is 15061424462663. The reversal of 15061424462661 is 16626442416051.
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 not a de Polignac number, because 15061424462661 - 27 = 15061424462533 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 15061424462661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15061424462663) 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, 2510237410441 + ... + 2510237410446.
It is an arithmetic number, because the mean of its divisors is an integer number (5020474820888).
Almost surely, 215061424462661 is an apocalyptic number.
It is an amenable number.
15061424462661 is a deficient number, since it is larger than the sum of its proper divisors (5020474820891).
15061424462661 is an equidigital number, since it uses as much as digits as its factorization.
15061424462661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5020474820890.
The product of its (nonzero) digits is 1658880, while the sum is 48.
The spelling of 15061424462661 in words is "fifteen trillion, sixty-one billion, four hundred twenty-four million, four hundred sixty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •