Base | Representation |
---|---|
bin | 1000000101011100101… |
… | …0110000001010111111 |
3 | 111021112021110201011111 |
4 | 2001113022300022333 |
5 | 4233432223440030 |
6 | 143451014502451 |
7 | 13015051222513 |
oct | 2012712601277 |
9 | 437467421144 |
10 | 138901390015 |
11 | 539a9239203 |
12 | 22b05964a27 |
13 | 101380a9c0b |
14 | 6a19772143 |
15 | 392e56262a |
hex | 20572b02bf |
138901390015 has 8 divisors (see below), whose sum is σ = 166684612608. Its totient is φ = 111119148960.
The previous prime is 138901390013. The next prime is 138901390027. The reversal of 138901390015 is 510093109831.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 138901390015 - 21 = 138901390013 is a prime.
It is a super-2 number, since 2×1389013900152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 138901390015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138901390013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113730 + ... + 539200.
It is an arithmetic number, because the mean of its divisors is an integer number (20835576576).
Almost surely, 2138901390015 is an apocalyptic number.
138901390015 is a deficient number, since it is larger than the sum of its proper divisors (27783222593).
138901390015 is an equidigital number, since it uses as much as digits as its factorization.
138901390015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 490769.
The product of its (nonzero) digits is 29160, while the sum is 40.
Adding to 138901390015 its reverse (510093109831), we get a palindrome (648994499846).
The spelling of 138901390015 in words is "one hundred thirty-eight billion, nine hundred one million, three hundred ninety thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •