Base | Representation |
---|---|
bin | 1001001111011110111110… |
… | …00011000101001101001111 |
3 | 2122221212211000020221202111 |
4 | 10213233133003011031033 |
5 | 10130433434443414203 |
6 | 111120210350204451 |
7 | 4165206434102353 |
oct | 447573703051517 |
9 | 78855730227674 |
10 | 20323232404303 |
11 | 6526041959574 |
12 | 23429414b3727 |
13 | b4561b39322a |
14 | 503914aa7463 |
15 | 2539c1e6026d |
hex | 127bdf0c534f |
20323232404303 has 8 divisors (see below), whose sum is σ = 20333043660240. Its totient is φ = 20313421848000.
The previous prime is 20323232404291. The next prime is 20323232404327. The reversal of 20323232404303 is 30340423232302.
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 20323232404303 - 25 = 20323232404271 is a prime.
It is a super-2 number, since 2×203232324043032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20323232404333) 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, 63491883 + ... + 63811171.
It is an arithmetic number, because the mean of its divisors is an integer number (2541630457530).
Almost surely, 220323232404303 is an apocalyptic number.
20323232404303 is a deficient number, since it is larger than the sum of its proper divisors (9811255937).
20323232404303 is a wasteful number, since it uses less digits than its factorization.
20323232404303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349817.
The product of its (nonzero) digits is 62208, while the sum is 31.
Adding to 20323232404303 its reverse (30340423232302), we get a palindrome (50663655636605).
The spelling of 20323232404303 in words is "twenty trillion, three hundred twenty-three billion, two hundred thirty-two million, four hundred four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •