Base | Representation |
---|---|
bin | 1001001001011110111000… |
… | …11100010000001100000111 |
3 | 2122020011120102111201201021 |
4 | 10210233130130100030013 |
5 | 10114044134220203111 |
6 | 110441345222212011 |
7 | 4144256522452603 |
oct | 444573434201407 |
9 | 78204512451637 |
10 | 20117030241031 |
11 | 64566481372a9 |
12 | 230a994884007 |
13 | b2c049144479 |
14 | 4d7952dd0503 |
15 | 24d45426cd71 |
hex | 124bdc710307 |
20117030241031 has 4 divisors (see below), whose sum is σ = 20117489777064. Its totient is φ = 20116570705000.
The previous prime is 20117030241019. The next prime is 20117030241053. The reversal of 20117030241031 is 13014203071102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20117030241031 - 215 = 20117030208263 is a prime.
It is a super-2 number, since 2×201170302410312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20117030240987 and 20117030241005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20117030241131) 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, 229702345 + ... + 229789906.
It is an arithmetic number, because the mean of its divisors is an integer number (5029372444266).
Almost surely, 220117030241031 is an apocalyptic number.
20117030241031 is a deficient number, since it is larger than the sum of its proper divisors (459536033).
20117030241031 is an equidigital number, since it uses as much as digits as its factorization.
20117030241031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459536032.
The product of its (nonzero) digits is 1008, while the sum is 25.
The spelling of 20117030241031 in words is "twenty trillion, one hundred seventeen billion, thirty million, two hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •