Base | Representation |
---|---|
bin | 10111011100010100010011… |
… | …101110111110100001110011 |
3 | 111112001100202102110110022010 |
4 | 113130110103232332201303 |
5 | 102003201342340203243 |
6 | 1003135542153214003 |
7 | 30500542262003322 |
oct | 2734242356764163 |
9 | 445040672413263 |
10 | 103101021022323 |
11 | 2a93a996590155 |
12 | b691803401303 |
13 | 456b4ccb732ac |
14 | 1b6618a5ca0b9 |
15 | bdbd62bd3433 |
hex | 5dc513bbe873 |
103101021022323 has 8 divisors (see below), whose sum is σ = 137469080488336. Its totient is φ = 68733487785600.
The previous prime is 103101021022301. The next prime is 103101021022333. The reversal of 103101021022323 is 323220120101301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103101021022323 - 29 = 103101021021811 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103101021022323.
It is not an unprimeable number, because it can be changed into a prime (103101021022333) 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, 131099938 + ... + 131884023.
It is an arithmetic number, because the mean of its divisors is an integer number (17183635061042).
Almost surely, 2103101021022323 is an apocalyptic number.
103101021022323 is a deficient number, since it is larger than the sum of its proper divisors (34368059466013).
103101021022323 is a wasteful number, since it uses less digits than its factorization.
103101021022323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263114645.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103101021022323 its reverse (323220120101301), we get a palindrome (426321141123624).
The spelling of 103101021022323 in words is "one hundred three trillion, one hundred one billion, twenty-one million, twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •