Base | Representation |
---|---|
bin | 1001001111101011100110… |
… | …01001010000110100111111 |
3 | 2122222112022111022010011022 |
4 | 10213311303021100310333 |
5 | 10131041331034120111 |
6 | 111123251213014355 |
7 | 4165536435635030 |
oct | 447656311206477 |
9 | 78875274263138 |
10 | 20330012020031 |
11 | 6528a0086817a |
12 | 2344113a843bb |
13 | b4615bb2587c |
14 | 503d99256a87 |
15 | 253c6c2452db |
hex | 127d73250d3f |
20330012020031 has 16 divisors (see below), whose sum is σ = 23369659790400. Its totient is φ = 17324213457408.
The previous prime is 20330012020007. The next prime is 20330012020033. The reversal of 20330012020031 is 13002021003302.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20330012020031 is a prime.
It is a super-2 number, since 2×203300120200312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20330012019991 and 20330012020009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20330012020033) 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, 27204605 + ... + 27941913.
It is an arithmetic number, because the mean of its divisors is an integer number (1460603736900).
Almost surely, 220330012020031 is an apocalyptic number.
20330012020031 is a deficient number, since it is larger than the sum of its proper divisors (3039647770369).
20330012020031 is a wasteful number, since it uses less digits than its factorization.
20330012020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760258.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20330012020031 its reverse (13002021003302), we get a palindrome (33332033023333).
The spelling of 20330012020031 in words is "twenty trillion, three hundred thirty billion, twelve million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •