Base | Representation |
---|---|
bin | 1011110101100010011101… |
… | …0111101111001110000111 |
3 | 1201002011110201011120211201 |
4 | 2331120213113233032013 |
5 | 3201212003312103111 |
6 | 43402423231443331 |
7 | 2512155151002430 |
oct | 275304727571607 |
9 | 51064421146751 |
10 | 13014411441031 |
11 | 4168420a78740 |
12 | 1562344086547 |
13 | 73533b5b3310 |
14 | 32dc88000487 |
15 | 17880498d6c1 |
hex | bd6275ef387 |
13014411441031 has 32 divisors (see below), whose sum is σ = 18233629682688. Its totient is φ = 8954014544640.
The previous prime is 13014411441011. The next prime is 13014411441067.
13014411441031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13014411441031 - 241 = 10815388185479 is a prime.
It is a super-2 number, since 2×130144114410312 (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 (13014411441011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 282616326 + ... + 282662371.
It is an arithmetic number, because the mean of its divisors is an integer number (569800927584).
Almost surely, 213014411441031 is an apocalyptic number.
13014411441031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13014411441031 is a deficient number, since it is larger than the sum of its proper divisors (5219218241657).
13014411441031 is a wasteful number, since it uses less digits than its factorization.
13014411441031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565278751.
The product of its (nonzero) digits is 2304, while the sum is 28.
It can be divided in two parts, 1301441 and 1441031, that added together give a palindrome (2742472).
The spelling of 13014411441031 in words is "thirteen trillion, fourteen billion, four hundred eleven million, four hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •