Base | Representation |
---|---|
bin | 100011001010010011111110… |
… | …001010010010101111100101 |
3 | 202021112110120001210121112111 |
4 | 203022103332022102233211 |
5 | 130232111231224330021 |
6 | 1304520431402121021 |
7 | 44400250652316520 |
oct | 4312237612225745 |
9 | 667473501717474 |
10 | 154640266636261 |
11 | 4530062906420a |
12 | 154163a04b0171 |
13 | 683968c690123 |
14 | 2a288b3777bb7 |
15 | 12d283535c8e1 |
hex | 8ca4fe292be5 |
154640266636261 has 32 divisors (see below), whose sum is σ = 178573832794368. Its totient is φ = 131174814597120.
The previous prime is 154640266636231. The next prime is 154640266636307. The reversal of 154640266636261 is 162636662046451.
It is not a de Polignac number, because 154640266636261 - 217 = 154640266505189 is a prime.
It is a super-2 number, since 2×1546402666362612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 154640266636196 and 154640266636205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154640266636231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 459281605 + ... + 459618181.
It is an arithmetic number, because the mean of its divisors is an integer number (5580432274824).
Almost surely, 2154640266636261 is an apocalyptic number.
It is an amenable number.
154640266636261 is a deficient number, since it is larger than the sum of its proper divisors (23933566158107).
154640266636261 is a wasteful number, since it uses less digits than its factorization.
154640266636261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338461.
The product of its (nonzero) digits is 44789760, while the sum is 58.
The spelling of 154640266636261 in words is "one hundred fifty-four trillion, six hundred forty billion, two hundred sixty-six million, six hundred thirty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •