Base | Representation |
---|---|
bin | 111111101000011000… |
… | …0000101111100111101 |
3 | 111001201010000221200002 |
4 | 1333100300011330331 |
5 | 4214322420120042 |
6 | 142435135244045 |
7 | 12605135666222 |
oct | 1772060057475 |
9 | 431633027602 |
10 | 136646254397 |
11 | 52a51280464 |
12 | 22596679625 |
13 | cb68b12743 |
14 | 6884061949 |
15 | 384b5a4132 |
hex | 1fd0c05f3d |
136646254397 has 4 divisors (see below), whose sum is σ = 138181605660. Its totient is φ = 135110903136.
The previous prime is 136646254387. The next prime is 136646254399. The reversal of 136646254397 is 793452646631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 61577926201 + 75068328196 = 248149^2 + 273986^2 .
It is a cyclic number.
It is not a de Polignac number, because 136646254397 - 214 = 136646238013 is a prime.
It is a super-3 number, since 3×1366462543973 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136646254399) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 767675498 + ... + 767675675.
It is an arithmetic number, because the mean of its divisors is an integer number (34545401415).
Almost surely, 2136646254397 is an apocalyptic number.
It is an amenable number.
136646254397 is a deficient number, since it is larger than the sum of its proper divisors (1535351263).
136646254397 is an equidigital number, since it uses as much as digits as its factorization.
136646254397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1535351262.
The product of its digits is 19595520, while the sum is 56.
The spelling of 136646254397 in words is "one hundred thirty-six billion, six hundred forty-six million, two hundred fifty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •