Base | Representation |
---|---|
bin | 101010000111001… |
… | …0010011010011101 |
3 | 10122110212102221000 |
4 | 1110032102122131 |
5 | 10343214002311 |
6 | 352114100513 |
7 | 50005366413 |
oct | 12416223235 |
9 | 3573772830 |
10 | 1413031581 |
11 | 66568a5a5 |
12 | 33527a739 |
13 | 196992180 |
14 | d59452b3 |
15 | 840bb056 |
hex | 5439269d |
1413031581 has 32 divisors (see below), whose sum is σ = 2285333120. Its totient is φ = 857630592.
The previous prime is 1413031579. The next prime is 1413031601. The reversal of 1413031581 is 1851303141.
It is not a de Polignac number, because 1413031581 - 21 = 1413031579 is a prime.
It is a super-2 number, since 2×14130315812 = 3993316497806719122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413031531) 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, 1951 + ... + 53196.
It is an arithmetic number, because the mean of its divisors is an integer number (71416660).
Almost surely, 21413031581 is an apocalyptic number.
It is an amenable number.
1413031581 is a deficient number, since it is larger than the sum of its proper divisors (872301539).
1413031581 is a wasteful number, since it uses less digits than its factorization.
1413031581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55242 (or 55236 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 1413031581 is about 37590.3123291095. The cubic root of 1413031581 is about 1122.1492480692.
It can be divided in two parts, 141303 and 1581, that added together give a square (142884 = 3782).
The spelling of 1413031581 in words is "one billion, four hundred thirteen million, thirty-one thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •