Base | Representation |
---|---|
bin | 111001010011000000… |
… | …1001001101110000111 |
3 | 102202121011202100210222 |
4 | 1302212001021232013 |
5 | 4003443331412403 |
6 | 132305324334555 |
7 | 11614104115055 |
oct | 1624601115607 |
9 | 382534670728 |
10 | 123044404103 |
11 | 482013a3a75 |
12 | 1ba1b3a445b |
13 | b7abb47c0a |
14 | 5d537cb1d5 |
15 | 33023bb338 |
hex | 1ca6049b87 |
123044404103 has 4 divisors (see below), whose sum is σ = 123090473568. Its totient is φ = 122998334640.
The previous prime is 123044404069. The next prime is 123044404121. The reversal of 123044404103 is 301404440321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301404440321 = 91237 ⋅3303533.
It is a cyclic number.
It is not a de Polignac number, because 123044404103 - 218 = 123044141959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123044404163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23030726 + ... + 23036067.
It is an arithmetic number, because the mean of its divisors is an integer number (30772618392).
Almost surely, 2123044404103 is an apocalyptic number.
123044404103 is a deficient number, since it is larger than the sum of its proper divisors (46069465).
123044404103 is an equidigital number, since it uses as much as digits as its factorization.
123044404103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46069464.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 123044404103 its reverse (301404440321), we get a palindrome (424448844424).
The spelling of 123044404103 in words is "one hundred twenty-three billion, forty-four million, four hundred four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •