Base | Representation |
---|---|
bin | 110000011100110010… |
… | …0111110111000010001 |
3 | 100221120002102100202000 |
4 | 1200321210332320101 |
5 | 3201041033224103 |
6 | 115444145544213 |
7 | 10342223463012 |
oct | 1407144767021 |
9 | 327502370660 |
10 | 104045211153 |
11 | 4014189a114 |
12 | 181b8645069 |
13 | 9a71900900 |
14 | 50703c3009 |
15 | 2a8e440aa3 |
hex | 183993ee11 |
104045211153 has 48 divisors (see below), whose sum is σ = 168388050240. Its totient is φ = 63460889856.
The previous prime is 104045211119. The next prime is 104045211169. The reversal of 104045211153 is 351112540401.
104045211153 is a `hidden beast` number, since 10 + 40 + 452 + 11 + 153 = 666.
It is not a de Polignac number, because 104045211153 - 29 = 104045210641 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104045211103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 414726 + ... + 616512.
It is an arithmetic number, because the mean of its divisors is an integer number (3508084380).
Almost surely, 2104045211153 is an apocalyptic number.
104045211153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
104045211153 is a deficient number, since it is larger than the sum of its proper divisors (64342839087).
104045211153 is a wasteful number, since it uses less digits than its factorization.
104045211153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201935 (or 201916 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 104045211153 its reverse (351112540401), we get a palindrome (455157751554).
The spelling of 104045211153 in words is "one hundred four billion, forty-five million, two hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •