Base | Representation |
---|---|
bin | 1001001001100101001011… |
… | …11010001100101010100011 |
3 | 2122020111021222201002111011 |
4 | 10210302211322030222203 |
5 | 10114123100014430311 |
6 | 110443104445001351 |
7 | 4144436344543141 |
oct | 444624572145243 |
9 | 78214258632434 |
10 | 20120410311331 |
11 | 64580220a0130 |
12 | 230b578853257 |
13 | b2c4674acb75 |
14 | 4d7b93c90591 |
15 | 24d5a0d8a321 |
hex | 124ca5e8caa3 |
20120410311331 has 8 divisors (see below), whose sum is σ = 21949614212400. Its totient is φ = 18291219025440.
The previous prime is 20120410311319. The next prime is 20120410311361. The reversal of 20120410311331 is 13311301402102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20120410311331 - 27 = 20120410311203 is a prime.
It is a super-2 number, since 2×201204103113312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20120410311361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350365 + ... + 6353233.
It is an arithmetic number, because the mean of its divisors is an integer number (2743701776550).
Almost surely, 220120410311331 is an apocalyptic number.
20120410311331 is a deficient number, since it is larger than the sum of its proper divisors (1829203901069).
20120410311331 is a wasteful number, since it uses less digits than its factorization.
20120410311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6307589.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 20120410311331 its reverse (13311301402102), we get a palindrome (33431711713433).
The spelling of 20120410311331 in words is "twenty trillion, one hundred twenty billion, four hundred ten million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •