Base | Representation |
---|---|
bin | 1001001111000110100001… |
… | …01010101110011000101101 |
3 | 2122220121221020001112112222 |
4 | 10213203100222232120231 |
5 | 10130230044144031321 |
6 | 111110200051005125 |
7 | 4164233236364426 |
oct | 447432052563055 |
9 | 78817836045488 |
10 | 20310106236461 |
11 | 652051653a378 |
12 | 23402995997a5 |
13 | b44308b18102 |
14 | 50302b69864d |
15 | 2534a48da3ab |
hex | 1278d0aae62d |
20310106236461 has 4 divisors (see below), whose sum is σ = 20444610251424. Its totient is φ = 20175602221500.
The previous prime is 20310106236439. The next prime is 20310106236499. The reversal of 20310106236461 is 16463260101302.
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 20310106236461 - 214 = 20310106220077 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 (20310106236421) 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, 67252007255 + ... + 67252007556.
It is an arithmetic number, because the mean of its divisors is an integer number (5111152562856).
Almost surely, 220310106236461 is an apocalyptic number.
It is an amenable number.
20310106236461 is a deficient number, since it is larger than the sum of its proper divisors (134504014963).
20310106236461 is a wasteful number, since it uses less digits than its factorization.
20310106236461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134504014962.
The product of its (nonzero) digits is 31104, while the sum is 35.
Adding to 20310106236461 its reverse (16463260101302), we get a palindrome (36773366337763).
The spelling of 20310106236461 in words is "twenty trillion, three hundred ten billion, one hundred six million, two hundred thirty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.533 sec. • engine limits •