Base | Representation |
---|---|
bin | 100011001001000100000111… |
… | …011101111000010110001010 |
3 | 202021020021020110210220222201 |
4 | 203021010013131320112022 |
5 | 130224210130443420132 |
6 | 1304413211243310414 |
7 | 44361124112104354 |
oct | 4311040735702612 |
9 | 667207213726881 |
10 | 154554523420042 |
11 | 45278229273849 |
12 | 1540185121b40a |
13 | 6831576738925 |
14 | 2a2469bd540d4 |
15 | 12d04b7a7a2e7 |
hex | 8c910777858a |
154554523420042 has 8 divisors (see below), whose sum is σ = 231872839119936. Its totient is φ = 77263577046732.
The previous prime is 154554523420013. The next prime is 154554523420043. The reversal of 154554523420042 is 240024325455451.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1545545234200422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 154554523419974 and 154554523420001.
It is not an unprimeable number, because it can be changed into a prime (154554523420043) 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, 6842317528 + ... + 6842340115.
It is an arithmetic number, because the mean of its divisors is an integer number (28984104889992).
Almost surely, 2154554523420042 is an apocalyptic number.
154554523420042 is a deficient number, since it is larger than the sum of its proper divisors (77318315699894).
154554523420042 is a wasteful number, since it uses less digits than its factorization.
154554523420042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13684663292.
The product of its (nonzero) digits is 3840000, while the sum is 46.
Adding to 154554523420042 its reverse (240024325455451), we get a palindrome (394578848875493).
The spelling of 154554523420042 in words is "one hundred fifty-four trillion, five hundred fifty-four billion, five hundred twenty-three million, four hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •