Base | Representation |
---|---|
bin | 1001010011011101111111… |
… | …11110100010011110100101 |
3 | 2200102222020001000012012102 |
4 | 10221232333332202132211 |
5 | 10140204341404321003 |
6 | 111303132503101445 |
7 | 4211124410063642 |
oct | 451567776423645 |
9 | 80388201005172 |
10 | 20460150073253 |
11 | 6579112359780 |
12 | 2365392a41885 |
13 | b554cb4a55a7 |
14 | 50a3c2bbadc9 |
15 | 257337278588 |
hex | 129bbffa27a5 |
20460150073253 has 4 divisors (see below), whose sum is σ = 22320163716288. Its totient is φ = 18600136430220.
The previous prime is 20460150073249. The next prime is 20460150073357. The reversal of 20460150073253 is 35237005106402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20460150073253 - 22 = 20460150073249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20460150073213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 930006821501 + ... + 930006821522.
It is an arithmetic number, because the mean of its divisors is an integer number (5580040929072).
Almost surely, 220460150073253 is an apocalyptic number.
It is an amenable number.
20460150073253 is a deficient number, since it is larger than the sum of its proper divisors (1860013643035).
20460150073253 is a wasteful number, since it uses less digits than its factorization.
20460150073253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1860013643034.
The product of its (nonzero) digits is 151200, while the sum is 38.
Adding to 20460150073253 its reverse (35237005106402), we get a palindrome (55697155179655).
The spelling of 20460150073253 in words is "twenty trillion, four hundred sixty billion, one hundred fifty million, seventy-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.001 sec. • engine limits •