Base | Representation |
---|---|
bin | 1001010100010010111… |
… | …00001101010101001111 |
3 | 1010121022122120102021120 |
4 | 10222021130031111033 |
5 | 20221113131000020 |
6 | 403022310532023 |
7 | 32062130311416 |
oct | 4521134152517 |
9 | 1117278512246 |
10 | 320133453135 |
11 | 113849a96671 |
12 | 52064067013 |
13 | 2425b0609a2 |
14 | 116cd04647d |
15 | 84d9edb740 |
hex | 4a8970d54f |
320133453135 has 32 divisors (see below), whose sum is σ = 528874334208. Its totient is φ = 165187109760.
The previous prime is 320133453131. The next prime is 320133453169. The reversal of 320133453135 is 531354331023.
It is not a de Polignac number, because 320133453135 - 22 = 320133453131 is a prime.
It is a super-2 number, since 2×3201334531352 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 320133453096 and 320133453105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320133453131) 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 31 ways as a sum of consecutive naturals, for example, 1736449 + ... + 1911941.
It is an arithmetic number, because the mean of its divisors is an integer number (16527322944).
Almost surely, 2320133453135 is an apocalyptic number.
320133453135 is a deficient number, since it is larger than the sum of its proper divisors (208740881073).
320133453135 is a wasteful number, since it uses less digits than its factorization.
320133453135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179455.
The product of its (nonzero) digits is 48600, while the sum is 33.
Adding to 320133453135 its reverse (531354331023), we get a palindrome (851487784158).
The spelling of 320133453135 in words is "three hundred twenty billion, one hundred thirty-three million, four hundred fifty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •