Base | Representation |
---|---|
bin | 111111110010111101… |
… | …1010001110110001001 |
3 | 111002121212111201022120 |
4 | 1333211323101312021 |
5 | 4221034341230413 |
6 | 142534305441453 |
7 | 12620011414542 |
oct | 1774573216611 |
9 | 432555451276 |
10 | 137001508233 |
11 | 53113863977 |
12 | 22675640289 |
13 | cbc45b8105 |
14 | 68b92d94c9 |
15 | 386c879723 |
hex | 1fe5ed1d89 |
137001508233 has 16 divisors (see below), whose sum is σ = 194825684160. Its totient is φ = 85334268416.
The previous prime is 137001508219. The next prime is 137001508247. The reversal of 137001508233 is 332805100731.
It is an interprime number because it is at equal distance from previous prime (137001508219) and next prime (137001508247).
It is not a de Polignac number, because 137001508233 - 214 = 137001491849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 137001508194 and 137001508203.
It is not an unprimeable number, because it can be changed into a prime (137001508333) 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 15 ways as a sum of consecutive naturals, for example, 9797043 + ... + 9811016.
It is an arithmetic number, because the mean of its divisors is an integer number (12176605260).
Almost surely, 2137001508233 is an apocalyptic number.
It is an amenable number.
137001508233 is a deficient number, since it is larger than the sum of its proper divisors (57824175927).
137001508233 is a wasteful number, since it uses less digits than its factorization.
137001508233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19608216.
The product of its (nonzero) digits is 15120, while the sum is 33.
Adding to 137001508233 its reverse (332805100731), we get a palindrome (469806608964).
The spelling of 137001508233 in words is "one hundred thirty-seven billion, one million, five hundred eight thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •