Base | Representation |
---|---|
bin | 10111101001101111001011… |
… | …110111011100011011101010 |
3 | 111122022112010222110200002111 |
4 | 113221233023313130123222 |
5 | 102113304040203013200 |
6 | 1005123340313552534 |
7 | 30624300456421231 |
oct | 2751571367343352 |
9 | 448275128420074 |
10 | 104023233251050 |
11 | 30166007321173 |
12 | b80049641574a |
13 | 460746c42a7b9 |
14 | 1b98a739d9b18 |
15 | c05d3a2b10ba |
hex | 5e9bcbddc6ea |
104023233251050 has 24 divisors (see below), whose sum is σ = 204864579369036. Its totient is φ = 39161687811840.
The previous prime is 104023233251017. The next prime is 104023233251053. The reversal of 104023233251050 is 50152332320401.
It can be written as a sum of positive squares in 6 ways, for example, as 71400184718769 + 32623048532281 = 8449863^2 + 5711659^2 .
It is a super-2 number, since 2×1040232332510502 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104023233251053) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61190136357 + ... + 61190138056.
Almost surely, 2104023233251050 is an apocalyptic number.
104023233251050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104023233251050 is a deficient number, since it is larger than the sum of its proper divisors (100841346117986).
104023233251050 is a wasteful number, since it uses less digits than its factorization.
104023233251050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122380274442 (or 122380274437 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 104023233251050 its reverse (50152332320401), we get a palindrome (154175565571451).
The spelling of 104023233251050 in words is "one hundred four trillion, twenty-three billion, two hundred thirty-three million, two hundred fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •