Base | Representation |
---|---|
bin | 11111011111101001010001… |
… | …110110001010110010100110 |
3 | 200011102211000120212201211202 |
4 | 133133221101312022302212 |
5 | 121123403303010403340 |
6 | 1210332252401002502 |
7 | 41114211512360066 |
oct | 3737512166126246 |
9 | 604384016781752 |
10 | 138514068450470 |
11 | 40153539649a29 |
12 | 13650b55323432 |
13 | 5c39a88b513cb |
14 | 262c18c2753a6 |
15 | 1103107296c15 |
hex | 7dfa51d8aca6 |
138514068450470 has 32 divisors (see below), whose sum is σ = 251656901632800. Its totient is φ = 54887504749056.
The previous prime is 138514068450419. The next prime is 138514068450479. The reversal of 138514068450470 is 74054860415831.
138514068450470 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1385140684504702 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138514068450479) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 306445796 + ... + 306897464.
It is an arithmetic number, because the mean of its divisors is an integer number (7864278176025).
Almost surely, 2138514068450470 is an apocalyptic number.
138514068450470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
138514068450470 is a deficient number, since it is larger than the sum of its proper divisors (113142833182330).
138514068450470 is a wasteful number, since it uses less digits than its factorization.
138514068450470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738392.
The product of its (nonzero) digits is 12902400, while the sum is 56.
The spelling of 138514068450470 in words is "one hundred thirty-eight trillion, five hundred fourteen billion, sixty-eight million, four hundred fifty thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •