Base | Representation |
---|---|
bin | 11111000001100111001011… |
… | …010001110101011011000101 |
3 | 122220010111212220002120222011 |
4 | 133001213023101311123011 |
5 | 120341100030434223431 |
6 | 1202112211344534221 |
7 | 40512126546136522 |
oct | 3701471321653305 |
9 | 586114786076864 |
10 | 136450226476741 |
11 | 3a528241661391 |
12 | 13378b74921371 |
13 | 5b1a27cbba728 |
14 | 259a324996149 |
15 | 10b95b4608cb1 |
hex | 7c19cb4756c5 |
136450226476741 has 6 divisors (see below), whose sum is σ = 142640784956390. Its totient is φ = 130517607933768.
The previous prime is 136450226476723. The next prime is 136450226476909. The reversal of 136450226476741 is 147674622054631.
It can be written as a sum of positive squares in only one way, i.e., 126496043726116 + 9954182750625 = 11247046^2 + 3155025^2 .
It is not a de Polignac number, because 136450226476741 - 241 = 134251203221189 is a prime.
It is a super-2 number, since 2×1364502264767412 (a number of 29 digits) contains 22 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 (136450226476441) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 128969967786 + ... + 128969968843.
Almost surely, 2136450226476741 is an apocalyptic number.
It is an amenable number.
136450226476741 is a deficient number, since it is larger than the sum of its proper divisors (6190558479649).
136450226476741 is an equidigital number, since it uses as much as digits as its factorization.
136450226476741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257939936675 (or 257939936652 counting only the distinct ones).
The product of its (nonzero) digits is 40642560, while the sum is 58.
The spelling of 136450226476741 in words is "one hundred thirty-six trillion, four hundred fifty billion, two hundred twenty-six million, four hundred seventy-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •