Base | Representation |
---|---|
bin | 100001000111000100100110… |
… | …101010000101011000110010 |
3 | 201002121021120201222121120012 |
4 | 201013010212222011120302 |
5 | 123041330330233042302 |
6 | 1233413333401214522 |
7 | 42446543613120500 |
oct | 4107044652053062 |
9 | 632537521877505 |
10 | 145621514737202 |
11 | 424438127a6849 |
12 | 143ba512791442 |
13 | 633408588bb9a |
14 | 27d619445b670 |
15 | 11c7e3a7a2a52 |
hex | 847126a85632 |
145621514737202 has 24 divisors (see below), whose sum is σ = 254281381160220. Its totient is φ = 62363365128960.
The previous prime is 145621514737189. The next prime is 145621514737217. The reversal of 145621514737202 is 202737415126541.
It can be written as a sum of positive squares in 2 ways, for example, as 145472280093721 + 149234643481 = 12061189^2 + 386309^2 .
It is a super-2 number, since 2×1456215147372022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 545764427 + ... + 546031182.
Almost surely, 2145621514737202 is an apocalyptic number.
145621514737202 is a deficient number, since it is larger than the sum of its proper divisors (108659866423018).
145621514737202 is a wasteful number, since it uses less digits than its factorization.
145621514737202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091796986 (or 1091796979 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 50.
The spelling of 145621514737202 in words is "one hundred forty-five trillion, six hundred twenty-one billion, five hundred fourteen million, seven hundred thirty-seven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •