Base | Representation |
---|---|
bin | 1110001001001000101000… |
… | …11011101110000000111111 |
3 | 11002010011001110222102210012 |
4 | 13010210110123232000333 |
5 | 13034021202424013043 |
6 | 150051122440533435 |
7 | 6356625654530450 |
oct | 704442433560077 |
9 | 132104043872705 |
10 | 31100201001023 |
11 | 9a005807590a0 |
12 | 35a351648127b |
13 | 1447975a6232b |
14 | 797387417127 |
15 | 38dec3230a18 |
hex | 1c49146ee03f |
31100201001023 has 16 divisors (see below), whose sum is σ = 39079585849344. Its totient is φ = 24043104560160.
The previous prime is 31100201001011. The next prime is 31100201001091. The reversal of 31100201001023 is 32010010200113.
It is not a de Polignac number, because 31100201001023 - 212 = 31100200996927 is a prime.
It is a super-2 number, since 2×311002010010232 (a number of 28 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 = 31100201000989 and 31100201001007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31100201001823) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1590142640 + ... + 1590162197.
It is an arithmetic number, because the mean of its divisors is an integer number (2442474115584).
Almost surely, 231100201001023 is an apocalyptic number.
31100201001023 is a deficient number, since it is larger than the sum of its proper divisors (7979384848321).
31100201001023 is a wasteful number, since it uses less digits than its factorization.
31100201001023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3180304982.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 31100201001023 its reverse (32010010200113), we get a palindrome (63110211201136).
The spelling of 31100201001023 in words is "thirty-one trillion, one hundred billion, two hundred one million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •