Base | Representation |
---|---|
bin | 1000000100110010001… |
… | …0110110000101110000 |
3 | 111021001212002111112010 |
4 | 2001030202312011300 |
5 | 4233101112000321 |
6 | 143421210402520 |
7 | 13010455242012 |
oct | 2011442660560 |
9 | 437055074463 |
10 | 138723156336 |
11 | 53917672646 |
12 | 22a76130440 |
13 | 1010a1a3cbb |
14 | 69ddc181b2 |
15 | 391daa7676 |
hex | 204c8b6170 |
138723156336 has 40 divisors (see below), whose sum is σ = 358381962880. Its totient is φ = 46239270336.
The previous prime is 138723156329. The next prime is 138723156343. The reversal of 138723156336 is 633651327831.
It is an interprime number because it is at equal distance from previous prime (138723156329) and next prime (138723156343).
It is a super-2 number, since 2×1387231563362 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1941501 + ... + 2011683.
It is an arithmetic number, because the mean of its divisors is an integer number (8959549072).
Almost surely, 2138723156336 is an apocalyptic number.
138723156336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
138723156336 is an abundant number, since it is smaller than the sum of its proper divisors (219658806544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138723156336 is a wasteful number, since it uses less digits than its factorization.
138723156336 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111373 (or 111367 counting only the distinct ones).
The product of its digits is 1632960, while the sum is 48.
The spelling of 138723156336 in words is "one hundred thirty-eight billion, seven hundred twenty-three million, one hundred fifty-six thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •