Base | Representation |
---|---|
bin | 11001000110011101… |
… | …11101101010100101 |
3 | 1021210011112002210210 |
4 | 30203032331222211 |
5 | 210044330331140 |
6 | 10105114010033 |
7 | 654643224405 |
oct | 144316755245 |
9 | 37704462723 |
10 | 13476027045 |
11 | 5795958638 |
12 | 2741116919 |
13 | 1369bb2200 |
14 | 91ba80805 |
15 | 53d131d80 |
hex | 3233bdaa5 |
13476027045 has 24 divisors (see below), whose sum is σ = 23347819296. Its totient is φ = 6634350528.
The previous prime is 13476027043. The next prime is 13476027049. The reversal of 13476027045 is 54072067431.
It is not a de Polignac number, because 13476027045 - 21 = 13476027043 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13476026994 and 13476027012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13476027043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2655459 + ... + 2660528.
It is an arithmetic number, because the mean of its divisors is an integer number (972825804).
Almost surely, 213476027045 is an apocalyptic number.
13476027045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13476027045 is a deficient number, since it is larger than the sum of its proper divisors (9871792251).
13476027045 is a wasteful number, since it uses less digits than its factorization.
13476027045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5316021 (or 5316008 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 39.
The spelling of 13476027045 in words is "thirteen billion, four hundred seventy-six million, twenty-seven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •