Base | Representation |
---|---|
bin | 10000011110100011010… |
… | …000000111100101110101 |
3 | 11000020201000000121221212 |
4 | 100132203100013211311 |
5 | 122022440204413303 |
6 | 2224102314451205 |
7 | 144543554222435 |
oct | 20364320074565 |
9 | 4006630017855 |
10 | 1132315310453 |
11 | 3a7237523038 |
12 | 16354a133b05 |
13 | 82a13a46252 |
14 | 3cb392082c5 |
15 | 1e6c29c2ad8 |
hex | 107a3407975 |
1132315310453 has 8 divisors (see below), whose sum is σ = 1161633731040. Its totient is φ = 1103343853680.
The previous prime is 1132315310437. The next prime is 1132315310459. The reversal of 1132315310453 is 3540135132311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1132315310453 - 24 = 1132315310437 is a prime.
It is a super-3 number, since 3×11323153104533 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132315310459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86734343 + ... + 86747396.
It is an arithmetic number, because the mean of its divisors is an integer number (145204216380).
Almost surely, 21132315310453 is an apocalyptic number.
It is an amenable number.
1132315310453 is a deficient number, since it is larger than the sum of its proper divisors (29318420587).
1132315310453 is a wasteful number, since it uses less digits than its factorization.
1132315310453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173481907.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 1132315310453 in words is "one trillion, one hundred thirty-two billion, three hundred fifteen million, three hundred ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •