Base | Representation |
---|---|
bin | 1001011101111100011101000… |
… | …1100011100001001111011010 |
3 | 10020100222012222210020201121100 |
4 | 2113133013101203201033122 |
5 | 1144311211421221002104 |
6 | 10320551512214052230 |
7 | 260222323016104110 |
oct | 22737072143411732 |
9 | 3210865883221540 |
10 | 666243137672154 |
11 | 183316145325219 |
12 | 6288247294a076 |
13 | 2279a5c5b74763 |
14 | ba744a8a45ab0 |
15 | 52057a6350139 |
hex | 25df1d18e13da |
666243137672154 has 24 divisors (see below), whose sum is σ = 1649744912331360. Its totient is φ = 190355182192008.
The previous prime is 666243137672153. The next prime is 666243137672237. The reversal of 666243137672154 is 451276731342666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 666243137672091 and 666243137672100.
It is not an unprimeable number, because it can be changed into a prime (666243137672153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2643821974764 + ... + 2643821975015.
It is an arithmetic number, because the mean of its divisors is an integer number (68739371347140).
Almost surely, 2666243137672154 is an apocalyptic number.
666243137672154 is an abundant number, since it is smaller than the sum of its proper divisors (983501774659206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
666243137672154 is a wasteful number, since it uses less digits than its factorization.
666243137672154 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5287643949794 (or 5287643949791 counting only the distinct ones).
The product of its digits is 182891520, while the sum is 63.
The spelling of 666243137672154 in words is "six hundred sixty-six trillion, two hundred forty-three billion, one hundred thirty-seven million, six hundred seventy-two thousand, one hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •