Base | Representation |
---|---|
bin | 1001010011100101001111… |
… | …1011111001110100000111 |
3 | 1100020011122002101021210110 |
4 | 2110321103323321310013 |
5 | 2320120134144430203 |
6 | 33432305241324103 |
7 | 2104145000425500 |
oct | 224712373716407 |
9 | 40204562337713 |
10 | 10232020311303 |
11 | 329541479900a |
12 | 119304aa96633 |
13 | 592b4c278b5b |
14 | 275337abdba7 |
15 | 12b259566d03 |
hex | 94e53ef9d07 |
10232020311303 has 12 divisors (see below), whose sum is σ = 15870072319800. Its totient is φ = 5846868749232.
The previous prime is 10232020311299. The next prime is 10232020311319. The reversal of 10232020311303 is 30311302023201.
It is not a de Polignac number, because 10232020311303 - 22 = 10232020311299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 10232020311303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232020311103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34802790028 + ... + 34802790321.
It is an arithmetic number, because the mean of its divisors is an integer number (1322506026650).
Almost surely, 210232020311303 is an apocalyptic number.
10232020311303 is a deficient number, since it is larger than the sum of its proper divisors (5638052008497).
10232020311303 is an equidigital number, since it uses as much as digits as its factorization.
10232020311303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69605580366 (or 69605580359 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10232020311303 its reverse (30311302023201), we get a palindrome (40543322334504).
The spelling of 10232020311303 in words is "ten trillion, two hundred thirty-two billion, twenty million, three hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •