Base | Representation |
---|---|
bin | 11001100011111011… |
… | …01001101100110101 |
3 | 1022102101112002201222 |
4 | 30301331221230311 |
5 | 211101111201221 |
6 | 10145422400125 |
7 | 664033553051 |
oct | 146175515465 |
9 | 38371462658 |
10 | 13723147061 |
11 | 59023a4558 |
12 | 27aba30045 |
13 | 13a9156a80 |
14 | 94280ac61 |
15 | 554b979ab |
hex | 331f69b35 |
13723147061 has 4 divisors (see below), whose sum is σ = 14778773772. Its totient is φ = 12667520352.
The previous prime is 13723147033. The next prime is 13723147069. The reversal of 13723147061 is 16074132731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16074132731 = 29 ⋅554280439.
It can be written as a sum of positive squares in 2 ways, for example, as 6647140900 + 7076006161 = 81530^2 + 84119^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13723147061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13723147069) 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, 527813336 + ... + 527813361.
It is an arithmetic number, because the mean of its divisors is an integer number (3694693443).
Almost surely, 213723147061 is an apocalyptic number.
It is an amenable number.
13723147061 is a deficient number, since it is larger than the sum of its proper divisors (1055626711).
13723147061 is a wasteful number, since it uses less digits than its factorization.
13723147061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1055626710.
The product of its (nonzero) digits is 21168, while the sum is 35.
Adding to 13723147061 its reverse (16074132731), we get a palindrome (29797279792).
The spelling of 13723147061 in words is "thirteen billion, seven hundred twenty-three million, one hundred forty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •