Base | Representation |
---|---|
bin | 1001001100110111000110… |
… | …10110010001111110110011 |
3 | 2122122021012020111022010111 |
4 | 10212123203112101332303 |
5 | 10122444402204424021 |
6 | 111010543523242151 |
7 | 4155536222222314 |
oct | 446334326217663 |
9 | 78567166438114 |
10 | 20233110233011 |
11 | 64a08a5283375 |
12 | 232938b819357 |
13 | b39c88166960 |
14 | 4dd40588660b |
15 | 251499eee8e1 |
hex | 1266e3591fb3 |
20233110233011 has 8 divisors (see below), whose sum is σ = 23071238817984. Its totient is φ = 17578086718080.
The previous prime is 20233110233009. The next prime is 20233110233047. The reversal of 20233110233011 is 11033201133202.
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 20233110233011 - 21 = 20233110233009 is a prime.
It is a super-2 number, since 2×202331102330112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20233110233911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45776267275 + ... + 45776267716.
It is an arithmetic number, because the mean of its divisors is an integer number (2883904852248).
Almost surely, 220233110233011 is an apocalyptic number.
20233110233011 is a deficient number, since it is larger than the sum of its proper divisors (2838128584973).
20233110233011 is a wasteful number, since it uses less digits than its factorization.
20233110233011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91552535021.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20233110233011 its reverse (11033201133202), we get a palindrome (31266311366213).
The spelling of 20233110233011 in words is "twenty trillion, two hundred thirty-three billion, one hundred ten million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •