Base | Representation |
---|---|
bin | 110111111100011000… |
… | …0010100101111101111 |
3 | 102111002120222002021212 |
4 | 1233320300110233233 |
5 | 3432020202100242 |
6 | 131105044145035 |
7 | 11452056123320 |
oct | 1577060245757 |
9 | 374076862255 |
10 | 120137534447 |
11 | 46a4a562857 |
12 | 1b34999817b |
13 | b4378403b8 |
14 | 5b59708447 |
15 | 31d20c1782 |
hex | 1bf8c14bef |
120137534447 has 64 divisors (see below), whose sum is σ = 154149101568. Its totient is φ = 91252224000.
The previous prime is 120137534437. The next prime is 120137534477. The reversal of 120137534447 is 744435731021.
It is not a de Polignac number, because 120137534447 - 26 = 120137534383 is a prime.
It is a super-2 number, since 2×1201375344472 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120137534417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 69724928 + ... + 69726650.
It is an arithmetic number, because the mean of its divisors is an integer number (2408579712).
Almost surely, 2120137534447 is an apocalyptic number.
120137534447 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
120137534447 is a deficient number, since it is larger than the sum of its proper divisors (34011567121).
120137534447 is a wasteful number, since it uses less digits than its factorization.
120137534447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2280.
The product of its (nonzero) digits is 282240, while the sum is 41.
The spelling of 120137534447 in words is "one hundred twenty billion, one hundred thirty-seven million, five hundred thirty-four thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •