Base | Representation |
---|---|
bin | 1001100011001101011110… |
… | …00111101111101011100011 |
3 | 2202100200100002221112222000 |
4 | 10301212233013233223203 |
5 | 10223040103441401001 |
6 | 112355424052415043 |
7 | 4265163115312344 |
oct | 461465707575343 |
9 | 82320302845860 |
10 | 21001033153251 |
11 | 67675407a0298 |
12 | 2432183617483 |
13 | b94509626a58 |
14 | 5286539a20cb |
15 | 26644217ba86 |
hex | 1319af1efae3 |
21001033153251 has 16 divisors (see below), whose sum is σ = 31871486629920. Its totient is φ = 13659208554240.
The previous prime is 21001033153229. The next prime is 21001033153279. The reversal of 21001033153251 is 15235133010012.
21001033153251 is a `hidden beast` number, since 2 + 1 + 0 + 0 + 1 + 0 + 331 + 5 + 325 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-21001033153251 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (21001033153291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9485560390 + ... + 9485562603.
It is an arithmetic number, because the mean of its divisors is an integer number (1991967914370).
Almost surely, 221001033153251 is an apocalyptic number.
21001033153251 is a deficient number, since it is larger than the sum of its proper divisors (10870453476669).
21001033153251 is a wasteful number, since it uses less digits than its factorization.
21001033153251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18971123043 (or 18971123037 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 21001033153251 its reverse (15235133010012), we get a palindrome (36236166163263).
The spelling of 21001033153251 in words is "twenty-one trillion, one billion, thirty-three million, one hundred fifty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •