Base | Representation |
---|---|
bin | 100000111110001110011000… |
… | …110011010011101011101110 |
3 | 201000110011022020112120010210 |
4 | 200332032120303103223232 |
5 | 123001400214331323041 |
6 | 1232230145211043250 |
7 | 42354611546412534 |
oct | 4076163063235356 |
9 | 630404266476123 |
10 | 145013544401646 |
11 | 42229998357178 |
12 | 1432071a740526 |
13 | 62bb9458a68bb |
14 | 27b499b832154 |
15 | 11b7205d49016 |
hex | 83e398cd3aee |
145013544401646 has 8 divisors (see below), whose sum is σ = 290027088803304. Its totient is φ = 48337848133880.
The previous prime is 145013544401617. The next prime is 145013544401669. The reversal of 145013544401646 is 646104445310541.
It is a sphenic number, since it is the product of 3 distinct primes.
145013544401646 is an admirable number.
It is a super-3 number, since 3×1450135444016463 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145013544401595 and 145013544401604.
It is a congruent number.
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, 12084462033465 + ... + 12084462033476.
It is an arithmetic number, because the mean of its divisors is an integer number (36253386100413).
Almost surely, 2145013544401646 is an apocalyptic number.
145013544401646 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145013544401646 is a wasteful number, since it uses less digits than its factorization.
145013544401646 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24168924066946.
The product of its (nonzero) digits is 2764800, while the sum is 48.
The spelling of 145013544401646 in words is "one hundred forty-five trillion, thirteen billion, five hundred forty-four million, four hundred one thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •