Base | Representation |
---|---|
bin | 1011110111010110001100… |
… | …0011001011000011001111 |
3 | 1201012010122202100120010210 |
4 | 2331311203003023003033 |
5 | 3202214114212012111 |
6 | 43425002024133503 |
7 | 2514335043522051 |
oct | 275654303130317 |
9 | 51163582316123 |
10 | 13045477454031 |
11 | 417a612a23050 |
12 | 1568374007293 |
13 | 73824c789429 |
14 | 331593c5b8d1 |
15 | 179521e880a6 |
hex | bdd630cb0cf |
13045477454031 has 128 divisors (see below), whose sum is σ = 20086528573440. Its totient is φ = 7458513753600.
The previous prime is 13045477454021. The next prime is 13045477454071.
13045477454031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13045477454031 - 27 = 13045477453903 is a prime.
It is a super-2 number, since 2×130454774540312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13045477454021) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2780956396 + ... + 2780961086.
It is an arithmetic number, because the mean of its divisors is an integer number (156926004480).
Almost surely, 213045477454031 is an apocalyptic number.
13045477454031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13045477454031 is a deficient number, since it is larger than the sum of its proper divisors (7041051119409).
13045477454031 is a wasteful number, since it uses less digits than its factorization.
13045477454031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5197.
The product of its (nonzero) digits is 2822400, while the sum is 48.
It can be divided in two parts, 1304547 and 7454031, that added together give a palindrome (8758578).
The spelling of 13045477454031 in words is "thirteen trillion, forty-five billion, four hundred seventy-seven million, four hundred fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •