Base | Representation |
---|---|
bin | 10000010111001… |
… | …11101100000000 |
3 | 100120021201122010 |
4 | 20023213230000 |
5 | 240114420442 |
6 | 21342012520 |
7 | 3254503134 |
oct | 1013475400 |
9 | 316251563 |
10 | 137263872 |
11 | 70533419 |
12 | 39b77140 |
13 | 2258cb35 |
14 | 143313c4 |
15 | c0b5b9c |
hex | 82e7b00 |
137263872 has 72 divisors (see below), whose sum is σ = 367069696. Its totient is φ = 45536256.
The previous prime is 137263801. The next prime is 137263891. The reversal of 137263872 is 278362731.
It is a self number, because there is not a number n which added to its sum of digits gives 137263872.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281613 + ... + 282099.
Almost surely, 2137263872 is an apocalyptic number.
137263872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 137263872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183534848).
137263872 is an abundant number, since it is smaller than the sum of its proper divisors (229805824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137263872 is an equidigital number, since it uses as much as digits as its factorization.
137263872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873 (or 859 counting only the distinct ones).
The product of its digits is 84672, while the sum is 39.
The square root of 137263872 is about 11715.9665414340. The cubic root of 137263872 is about 515.8444336037.
The spelling of 137263872 in words is "one hundred thirty-seven million, two hundred sixty-three thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •