Base | Representation |
---|---|
bin | 1000111011011110001… |
… | …0111101111000001001 |
3 | 112122221221021122021120 |
4 | 2032313202331320021 |
5 | 10003132213032413 |
6 | 154250020025453 |
7 | 14040322062300 |
oct | 2166742757011 |
9 | 478857248246 |
10 | 153403252233 |
11 | 5a070155a00 |
12 | 25892532289 |
13 | 1160967368a |
14 | 75d3767437 |
15 | 3ecc77a723 |
hex | 23b78bde09 |
153403252233 has 36 divisors (see below), whose sum is σ = 261528125040. Its totient is φ = 79689991920.
The previous prime is 153403252229. The next prime is 153403252241. The reversal of 153403252233 is 332252304351.
It is not a de Polignac number, because 153403252233 - 22 = 153403252229 is a prime.
It is a super-2 number, since 2×1534032522332 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 153403252194 and 153403252203.
It is not an unprimeable number, because it can be changed into a prime (153403252243) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4294443 + ... + 4330016.
It is an arithmetic number, because the mean of its divisors is an integer number (7264670140).
Almost surely, 2153403252233 is an apocalyptic number.
It is an amenable number.
153403252233 is a deficient number, since it is larger than the sum of its proper divisors (108124872807).
153403252233 is a wasteful number, since it uses less digits than its factorization.
153403252233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8624498 (or 8624480 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 153403252233 its reverse (332252304351), we get a palindrome (485655556584).
The spelling of 153403252233 in words is "one hundred fifty-three billion, four hundred three million, two hundred fifty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •