Base | Representation |
---|---|
bin | 10111011111001101110101… |
… | …000110010010110100100011 |
3 | 111112202101221011011102211220 |
4 | 113133031311012102310203 |
5 | 102014432324043122243 |
6 | 1003411244535310123 |
7 | 30521123553025020 |
oct | 2737156506226443 |
9 | 445671834142756 |
10 | 103300223020323 |
11 | 2aa0741895566a |
12 | b70433781b343 |
13 | 4584227a5bb24 |
14 | 1b71a86702547 |
15 | be2121077783 |
hex | 5df375192d23 |
103300223020323 has 8 divisors (see below), whose sum is σ = 157409863650048. Its totient is φ = 59028698868744.
The previous prime is 103300223020237. The next prime is 103300223020331. The reversal of 103300223020323 is 323020322003301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103300223020323 - 212 = 103300223016227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103300223020293 and 103300223020302.
It is not an unprimeable number, because it can be changed into a prime (103300223020373) 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, 2459529119511 + ... + 2459529119552.
It is an arithmetic number, because the mean of its divisors is an integer number (19676232956256).
Almost surely, 2103300223020323 is an apocalyptic number.
103300223020323 is a deficient number, since it is larger than the sum of its proper divisors (54109640629725).
103300223020323 is an equidigital number, since it uses as much as digits as its factorization.
103300223020323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4919058239073.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 103300223020323 its reverse (323020322003301), we get a palindrome (426320545023624).
The spelling of 103300223020323 in words is "one hundred three trillion, three hundred billion, two hundred twenty-three million, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •