Base | Representation |
---|---|
bin | 10100110110110000000110… |
… | …10011001010101110011000 |
3 | 20000101100002211222210002101 |
4 | 22123120003103022232120 |
5 | 22002344243313034000 |
6 | 241312325340213144 |
7 | 12442254036134032 |
oct | 1233300323125630 |
9 | 200340084883071 |
10 | 45861716143000 |
11 | 13681932171a8a |
12 | 5188383b3a1b4 |
13 | 1c789837747b4 |
14 | b47a0c964c52 |
15 | 547e7d974e6a |
hex | 29b6034cab98 |
45861716143000 has 32 divisors (see below), whose sum is σ = 107316415776960. Its totient is φ = 18344686456800.
The previous prime is 45861716142971. The next prime is 45861716143031. The reversal of 45861716143000 is 34161716854.
It is a super-2 number, since 2×458617161430002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22930857072 + ... + 22930859071.
It is an arithmetic number, because the mean of its divisors is an integer number (3353637993030).
Almost surely, 245861716143000 is an apocalyptic number.
45861716143000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
45861716143000 is an abundant number, since it is smaller than the sum of its proper divisors (61454699633960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45861716143000 is a wasteful number, since it uses less digits than its factorization.
45861716143000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45861716164 (or 45861716150 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 46.
Adding to 45861716143000 its reverse (34161716854), we get a palindrome (45895877859854).
The spelling of 45861716143000 in words is "forty-five trillion, eight hundred sixty-one billion, seven hundred sixteen million, one hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •