Base | Representation |
---|---|
bin | 1000111011001010011… |
… | …1011010110111000101 |
3 | 112122202011122002102202 |
4 | 2032302213122313011 |
5 | 10003000024032240 |
6 | 154233503044245 |
7 | 14035266013532 |
oct | 2166247326705 |
9 | 478664562382 |
10 | 153320533445 |
11 | 5a028498072 |
12 | 2586a8a0685 |
13 | 115c54a0951 |
14 | 75c6793d89 |
15 | 3ec538b315 |
hex | 23b29dadc5 |
153320533445 has 4 divisors (see below), whose sum is σ = 183984640140. Its totient is φ = 122656426752.
The previous prime is 153320533433. The next prime is 153320533477. The reversal of 153320533445 is 544335023351.
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 37846978849 + 115473554596 = 194543^2 + 339814^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153320533445 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 153320533399 and 153320533408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15332053340 + ... + 15332053349.
It is an arithmetic number, because the mean of its divisors is an integer number (45996160035).
Almost surely, 2153320533445 is an apocalyptic number.
It is an amenable number.
153320533445 is a deficient number, since it is larger than the sum of its proper divisors (30664106695).
153320533445 is an equidigital number, since it uses as much as digits as its factorization.
153320533445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30664106694.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 153320533445 its reverse (544335023351), we get a palindrome (697655556796).
The spelling of 153320533445 in words is "one hundred fifty-three billion, three hundred twenty million, five hundred thirty-three thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •