Base | Representation |
---|---|
bin | 100001011000111010100110… |
… | …010100011010001001000010 |
3 | 201020221111122020200200200110 |
4 | 201120322212110122021002 |
5 | 123221423113341434200 |
6 | 1240152525015132150 |
7 | 42634253310541320 |
oct | 4130724624321102 |
9 | 636844566620613 |
10 | 146847722218050 |
11 | 42876850975117 |
12 | 145780a5074056 |
13 | 63c28b08c35b9 |
14 | 2839679448d10 |
15 | 11e9ca6177b50 |
hex | 858ea651a242 |
146847722218050 has 48 divisors (see below), whose sum is σ = 416208401260992. Its totient is φ = 33565193649600.
The previous prime is 146847722217967. The next prime is 146847722218079. The reversal of 146847722218050 is 50812227748641.
It is a super-2 number, since 2×1468477222180502 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 69927485721 + ... + 69927487820.
It is an arithmetic number, because the mean of its divisors is an integer number (8671008359604).
Almost surely, 2146847722218050 is an apocalyptic number.
146847722218050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146847722218050 is an abundant number, since it is smaller than the sum of its proper divisors (269360679042942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146847722218050 is a wasteful number, since it uses less digits than its factorization.
146847722218050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139854973563 (or 139854973558 counting only the distinct ones).
The product of its (nonzero) digits is 12042240, while the sum is 57.
The spelling of 146847722218050 in words is "one hundred forty-six trillion, eight hundred forty-seven billion, seven hundred twenty-two million, two hundred eighteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •