Base | Representation |
---|---|
bin | 111001010100110001… |
… | …1011000101101111000 |
3 | 102202202022100102022100 |
4 | 1302221203120231320 |
5 | 4004104022210242 |
6 | 132315243423400 |
7 | 11615424161550 |
oct | 1625143305570 |
9 | 382668312270 |
10 | 123103710072 |
11 | 48231920472 |
12 | 1ba37224b60 |
13 | b7bb210cc5 |
14 | 5d5b628160 |
15 | 33076d354c |
hex | 1ca98d8b78 |
123103710072 has 48 divisors (see below), whose sum is σ = 381035294640. Its totient is φ = 35172488448.
The previous prime is 123103710071. The next prime is 123103710073. The reversal of 123103710072 is 270017301321.
It is an interprime number because it is at equal distance from previous prime (123103710071) and next prime (123103710073).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123103710071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 122126193 + ... + 122127200.
It is an arithmetic number, because the mean of its divisors is an integer number (7938235305).
Almost surely, 2123103710072 is an apocalyptic number.
123103710072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
123103710072 is an abundant number, since it is smaller than the sum of its proper divisors (257931584568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123103710072 is a wasteful number, since it uses less digits than its factorization.
123103710072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244253412 (or 244253405 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 27.
The spelling of 123103710072 in words is "one hundred twenty-three billion, one hundred three million, seven hundred ten thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •