Base | Representation |
---|---|
bin | 1001001111001000100111… |
… | …10101010111101000101010 |
3 | 2122220201211202110011011211 |
4 | 10213210103311113220222 |
5 | 10130234401133202310 |
6 | 111110503543343334 |
7 | 4164303201515014 |
oct | 447442365275052 |
9 | 78821752404154 |
10 | 20311233100330 |
11 | 6520a44632927 |
12 | 2340552a51b4a |
13 | b44458413473 |
14 | 5030d71cb1b4 |
15 | 25351d7cac8a |
hex | 127913d57a2a |
20311233100330 has 8 divisors (see below), whose sum is σ = 36560219580612. Its totient is φ = 8124493240128.
The previous prime is 20311233100273. The next prime is 20311233100331. The reversal of 20311233100330 is 3300133211302.
It can be written as a sum of positive squares in 2 ways, for example, as 20222046653449 + 89186446881 = 4496893^2 + 298641^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×203112331003302 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20311233100331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1015561655007 + ... + 1015561655026.
Almost surely, 220311233100330 is an apocalyptic number.
20311233100330 is a deficient number, since it is larger than the sum of its proper divisors (16248986480282).
20311233100330 is a wasteful number, since it uses less digits than its factorization.
20311233100330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031123310040.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 20311233100330 its reverse (3300133211302), we get a palindrome (23611366311632).
The spelling of 20311233100330 in words is "twenty trillion, three hundred eleven billion, two hundred thirty-three million, one hundred thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •