Base | Representation |
---|---|
bin | 1000111011100000110… |
… | …0101111010000100001 |
3 | 112122222200212222002100 |
4 | 2032320030233100201 |
5 | 10003143013434101 |
6 | 154251050441013 |
7 | 14040514130055 |
oct | 2167014572041 |
9 | 478880788070 |
10 | 153414202401 |
11 | 5a076354a29 |
12 | 25896133169 |
13 | 1160ba08875 |
14 | 75d4db7c65 |
15 | 3ecd6dee86 |
hex | 23b832f421 |
153414202401 has 6 divisors (see below), whose sum is σ = 221598292370. Its totient is φ = 102276134928.
The previous prime is 153414202363. The next prime is 153414202411. The reversal of 153414202401 is 104202414351.
153414202401 is a `hidden beast` number, since 1 + 5 + 3 + 414 + 2 + 0 + 240 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 145314202401 + 8100000000 = 381201^2 + 90000^2 .
It is not a de Polignac number, because 153414202401 - 27 = 153414202273 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (153414202411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8523011236 + ... + 8523011253.
Almost surely, 2153414202401 is an apocalyptic number.
It is an amenable number.
153414202401 is a deficient number, since it is larger than the sum of its proper divisors (68184089969).
153414202401 is a wasteful number, since it uses less digits than its factorization.
153414202401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17046022495 (or 17046022492 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 153414202401 its reverse (104202414351), we get a palindrome (257616616752).
The spelling of 153414202401 in words is "one hundred fifty-three billion, four hundred fourteen million, two hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •