Base | Representation |
---|---|
bin | 10111011111100010000111… |
… | …111000100010111111011011 |
3 | 111112211111011201220010012112 |
4 | 113133202013320202333123 |
5 | 102020311440313120443 |
6 | 1003425251050502535 |
7 | 30522524541666152 |
oct | 2737420770427733 |
9 | 445744151803175 |
10 | 103322013020123 |
11 | 2aa1568a828a67 |
12 | b7085b9134a4b |
13 | 45862bb234b31 |
14 | 1b72b5261a599 |
15 | be2999023b18 |
hex | 5df887e22fdb |
103322013020123 has 4 divisors (see below), whose sum is σ = 103322036700288. Its totient is φ = 103321989339960.
The previous prime is 103322013020087. The next prime is 103322013020131. The reversal of 103322013020123 is 321020310223301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103322013020123 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103322013023123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3187508 + ... + 14724273.
It is an arithmetic number, because the mean of its divisors is an integer number (25830509175072).
Almost surely, 2103322013020123 is an apocalyptic number.
103322013020123 is a deficient number, since it is larger than the sum of its proper divisors (23680165).
103322013020123 is an equidigital number, since it uses as much as digits as its factorization.
103322013020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23680164.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 103322013020123 its reverse (321020310223301), we get a palindrome (424342323243424).
The spelling of 103322013020123 in words is "one hundred three trillion, three hundred twenty-two billion, thirteen million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •