Base | Representation |
---|---|
bin | 10111011111100010001000… |
… | …010011001011101000010011 |
3 | 111112211111012020000211222112 |
4 | 113133202020103023220103 |
5 | 102020311444110033243 |
6 | 1003425251500255535 |
7 | 30522524655226343 |
oct | 2737421023135023 |
9 | 445744166024875 |
10 | 103322020002323 |
11 | 2aa15693767881 |
12 | b7085bb5415ab |
13 | 45862bc80ac05 |
14 | 1b72b53516d23 |
15 | be2999952818 |
hex | 5df8884cba13 |
103322020002323 has 4 divisors (see below), whose sum is σ = 103322066553528. Its totient is φ = 103321973451120.
The previous prime is 103322020002263. The next prime is 103322020002337. The reversal of 103322020002323 is 323200020223301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103322020002323 - 212 = 103322019998227 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103322020002023) 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, 19770338 + ... + 24444023.
It is an arithmetic number, because the mean of its divisors is an integer number (25830516638382).
Almost surely, 2103322020002323 is an apocalyptic number.
103322020002323 is a deficient number, since it is larger than the sum of its proper divisors (46551205).
103322020002323 is an equidigital number, since it uses as much as digits as its factorization.
103322020002323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46551204.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 103322020002323 its reverse (323200020223301), we get a palindrome (426522040225624).
The spelling of 103322020002323 in words is "one hundred three trillion, three hundred twenty-two billion, twenty million, two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •