Base | Representation |
---|---|
bin | 101011001101111… |
… | …0011110111000001 |
3 | 10202001200021121011 |
4 | 1112123303313001 |
5 | 10432213142011 |
6 | 355521200521 |
7 | 50635623553 |
oct | 12633636701 |
9 | 3661607534 |
10 | 1450130881 |
11 | 684619881 |
12 | 345790141 |
13 | 1a1581614 |
14 | da8414d3 |
15 | 87498621 |
hex | 566f3dc1 |
1450130881 has 4 divisors (see below), whose sum is σ = 1450753200. Its totient is φ = 1449508564.
The previous prime is 1450130861. The next prime is 1450130893. The reversal of 1450130881 is 1880310541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1880310541 = 383 ⋅4909427.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1450130881 is a prime.
It is a super-2 number, since 2×14501308812 = 4205759144059672322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1450130861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 307651 + ... + 312328.
It is an arithmetic number, because the mean of its divisors is an integer number (362688300).
Almost surely, 21450130881 is an apocalyptic number.
It is an amenable number.
1450130881 is a deficient number, since it is larger than the sum of its proper divisors (622319).
1450130881 is an equidigital number, since it uses as much as digits as its factorization.
1450130881 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 622318.
The product of its (nonzero) digits is 3840, while the sum is 31.
The square root of 1450130881 is about 38080.5840422649. The cubic root of 1450130881 is about 1131.8852496088.
The spelling of 1450130881 in words is "one billion, four hundred fifty million, one hundred thirty thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •