Base | Representation |
---|---|
bin | 110100111111010110001111… |
… | …0000101011101010011100100 |
3 | 2021010100000221020121121220020 |
4 | 1221332230132011131103210 |
5 | 442043113414044023134 |
6 | 4331152512301035140 |
7 | 200114563546202331 |
oct | 15176543605352344 |
9 | 2233300836547806 |
10 | 466103240611044 |
11 | 1255733020472a3 |
12 | 44339b20255ab0 |
13 | 17010468455c9a |
14 | 831573534b988 |
15 | 38d4635624b49 |
hex | 1a7eb1e15d4e4 |
466103240611044 has 12 divisors (see below), whose sum is σ = 1087574228092464. Its totient is φ = 155367746870344.
The previous prime is 466103240611037. The next prime is 466103240611103. The reversal of 466103240611044 is 440116042301664.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 466103240610987 and 466103240611005.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19420968358782 + ... + 19420968358805.
It is an arithmetic number, because the mean of its divisors is an integer number (90631185674372).
Almost surely, 2466103240611044 is an apocalyptic number.
It is an amenable number.
466103240611044 is an abundant number, since it is smaller than the sum of its proper divisors (621470987481420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
466103240611044 is a wasteful number, since it uses less digits than its factorization.
466103240611044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38841936717594 (or 38841936717592 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 42.
The spelling of 466103240611044 in words is "four hundred sixty-six trillion, one hundred three billion, two hundred forty million, six hundred eleven thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •