Base | Representation |
---|---|
bin | 1000111101010010111… |
… | …1111101100000100000 |
3 | 112201020002012110022202 |
4 | 2033110233331200200 |
5 | 10010133124312411 |
6 | 154410401152332 |
7 | 14055421412216 |
oct | 2172457754040 |
9 | 481202173282 |
10 | 153893197856 |
11 | 5a2a1775342 |
12 | 259aa62b6a8 |
13 | 11687018228 |
14 | 763c862cb6 |
15 | 400a7a983b |
hex | 23d4bfd820 |
153893197856 has 24 divisors (see below), whose sum is σ = 303394029120. Its totient is φ = 76840746048.
The previous prime is 153893197853. The next prime is 153893197883. The reversal of 153893197856 is 658791398351.
153893197856 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 153893197792 and 153893197801.
It is not an unprimeable number, because it can be changed into a prime (153893197853) 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 3 ways as a sum of consecutive naturals, for example, 3284276 + ... + 3330803.
It is an arithmetic number, because the mean of its divisors is an integer number (12641417880).
Almost surely, 2153893197856 is an apocalyptic number.
153893197856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
153893197856 is a deficient number, since it is larger than the sum of its proper divisors (149500831264).
153893197856 is an equidigital number, since it uses as much as digits as its factorization.
153893197856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6615816 (or 6615808 counting only the distinct ones).
The product of its digits is 48988800, while the sum is 65.
The spelling of 153893197856 in words is "one hundred fifty-three billion, eight hundred ninety-three million, one hundred ninety-seven thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •