Base | Representation |
---|---|
bin | 10010111010110000… |
… | …110101011010000111 |
3 | 1221102122221011012010 |
4 | 102322300311122013 |
5 | 313100141424111 |
6 | 13155355025303 |
7 | 1316244426510 |
oct | 227260653207 |
9 | 57378834163 |
10 | 20313233031 |
11 | 86843216a3 |
12 | 3b2aa3b233 |
13 | 1bb9559a20 |
14 | da9b41a07 |
15 | 7dd4e0aa6 |
hex | 4bac35687 |
20313233031 has 32 divisors (see below), whose sum is σ = 33351575040. Its totient is φ = 10709195904.
The previous prime is 20313232963. The next prime is 20313233033. The reversal of 20313233031 is 13033231302.
It is not a de Polignac number, because 20313233031 - 214 = 20313216647 is a prime.
It is a super-2 number, since 2×203132330312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 20313232989 and 20313233007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20313233033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 546856 + ... + 582818.
It is an arithmetic number, because the mean of its divisors is an integer number (1042236720).
Almost surely, 220313233031 is an apocalyptic number.
20313233031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20313233031 is a deficient number, since it is larger than the sum of its proper divisors (13038342009).
20313233031 is a wasteful number, since it uses less digits than its factorization.
20313233031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38055.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 20313233031 its reverse (13033231302), we get a palindrome (33346464333).
The spelling of 20313233031 in words is "twenty billion, three hundred thirteen million, two hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •