Base | Representation |
---|---|
bin | 10100011010101001111… |
… | …110110001110101000111 |
3 | 11222010102020222210220220 |
4 | 110122221332301311013 |
5 | 140441331323120111 |
6 | 2552311233555423 |
7 | 203235631651356 |
oct | 24325176616507 |
9 | 4863366883826 |
10 | 1403011145031 |
11 | 4a1017240101 |
12 | 1a7ab5715b73 |
13 | a23c36c11b2 |
14 | 4bc984b399d |
15 | 267676a5e06 |
hex | 146a9fb1d47 |
1403011145031 has 32 divisors (see below), whose sum is σ = 1911015203328. Its totient is φ = 915440240640.
The previous prime is 1403011145027. The next prime is 1403011145047. The reversal of 1403011145031 is 1305411103041.
It is not a de Polignac number, because 1403011145031 - 22 = 1403011145027 is a prime.
It is a super-2 number, since 2×14030111450312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1403011144992 and 1403011145010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1403011145021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10418116 + ... + 10551926.
It is an arithmetic number, because the mean of its divisors is an integer number (59719225104).
Almost surely, 21403011145031 is an apocalyptic number.
1403011145031 is a deficient number, since it is larger than the sum of its proper divisors (508004058297).
1403011145031 is a wasteful number, since it uses less digits than its factorization.
1403011145031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134311.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 1403011145031 its reverse (1305411103041), we get a palindrome (2708422248072).
The spelling of 1403011145031 in words is "one trillion, four hundred three billion, eleven million, one hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •