Base | Representation |
---|---|
bin | 1000111011111101101… |
… | …1101001111000011100 |
3 | 112200022011020012212220 |
4 | 2032333123221320130 |
5 | 10003420100144202 |
6 | 154311103425340 |
7 | 14043516445050 |
oct | 2167733517034 |
9 | 480264205786 |
10 | 153535553052 |
11 | 5a1288a9522 |
12 | 2590a8b5250 |
13 | 1162abb649b |
14 | 7607165c60 |
15 | 3ed91b0abc |
hex | 23bf6e9e1c |
153535553052 has 48 divisors (see below), whose sum is σ = 409517778432. Its totient is φ = 43857696960.
The previous prime is 153535552999. The next prime is 153535553069. The reversal of 153535553052 is 250355535351.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 153535552995 and 153535553013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 190393 + ... + 585935.
It is an arithmetic number, because the mean of its divisors is an integer number (8531620384).
Almost surely, 2153535553052 is an apocalyptic number.
153535553052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153535553052 is an abundant number, since it is smaller than the sum of its proper divisors (255982225380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153535553052 is a wasteful number, since it uses less digits than its factorization.
153535553052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400178 (or 400176 counting only the distinct ones).
The product of its (nonzero) digits is 843750, while the sum is 42.
The spelling of 153535553052 in words is "one hundred fifty-three billion, five hundred thirty-five million, five hundred fifty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •