Base | Representation |
---|---|
bin | 10101000110110001100… |
… | …101010111001001000001 |
3 | 12010122200201010122212002 |
4 | 111012301211113021001 |
5 | 142230341113340342 |
6 | 3030144044313345 |
7 | 206533564656266 |
oct | 25066145271101 |
9 | 5118621118762 |
10 | 1450383340097 |
11 | 50a11664743a |
12 | 1b5116542855 |
13 | a6a02c04153 |
14 | 502adc0526d |
15 | 27adb4c6d32 |
hex | 151b1957241 |
1450383340097 has 4 divisors (see below), whose sum is σ = 1485758543556. Its totient is φ = 1415008136640.
The previous prime is 1450383340079. The next prime is 1450383340151. The reversal of 1450383340097 is 7900433830541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40466954896 + 1409916385201 = 201164^2 + 1187399^2 .
It is a cyclic number.
It is not a de Polignac number, because 1450383340097 - 28 = 1450383339841 is a prime.
It is a super-2 number, since 2×14503833400972 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1450383340027) 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, 17687601668 + ... + 17687601749.
It is an arithmetic number, because the mean of its divisors is an integer number (371439635889).
Almost surely, 21450383340097 is an apocalyptic number.
It is an amenable number.
1450383340097 is a deficient number, since it is larger than the sum of its proper divisors (35375203459).
1450383340097 is an equidigital number, since it uses as much as digits as its factorization.
1450383340097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35375203458.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 1450383340097 in words is "one trillion, four hundred fifty billion, three hundred eighty-three million, three hundred forty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •