Base | Representation |
---|---|
bin | 11100111101101110… |
… | …101010100001000101 |
3 | 2222021102220201121222 |
4 | 130331232222201011 |
5 | 1002143201222041 |
6 | 22142021450125 |
7 | 2150461104665 |
oct | 347556524105 |
9 | 88242821558 |
10 | 31100414021 |
11 | 1220a411406 |
12 | 603b570945 |
13 | 2c1835c361 |
14 | 17106541a5 |
15 | c2054274b |
hex | 73dbaa845 |
31100414021 has 8 divisors (see below), whose sum is σ = 31183860000. Its totient is φ = 31017053520.
The previous prime is 31100414017. The next prime is 31100414029. The reversal of 31100414021 is 12041400113.
It is a happy number.
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 31100414021 - 22 = 31100414017 is a prime.
It is a super-2 number, since 2×311004140212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31100414029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 743615 + ... + 784323.
It is an arithmetic number, because the mean of its divisors is an integer number (3897982500).
Almost surely, 231100414021 is an apocalyptic number.
It is an amenable number.
31100414021 is a deficient number, since it is larger than the sum of its proper divisors (83445979).
31100414021 is a wasteful number, since it uses less digits than its factorization.
31100414021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42739.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 31100414021 its reverse (12041400113), we get a palindrome (43141814134).
The spelling of 31100414021 in words is "thirty-one billion, one hundred million, four hundred fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •