Base | Representation |
---|---|
bin | 1000100000011000110… |
… | …0001001100110111111 |
3 | 111222012020112011121010 |
4 | 2020012030021212333 |
5 | 4343234440031242 |
6 | 151044335410303 |
7 | 13362206523255 |
oct | 2100614114677 |
9 | 458166464533 |
10 | 146132736447 |
11 | 56a7a135875 |
12 | 243a3683993 |
13 | 10a1b2c3c29 |
14 | 7103d105d5 |
15 | 3c0432889c |
hex | 22063099bf |
146132736447 has 4 divisors (see below), whose sum is σ = 194843648600. Its totient is φ = 97421824296.
The previous prime is 146132736439. The next prime is 146132736499. The reversal of 146132736447 is 744637231641.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 146132736447 - 23 = 146132736439 is a prime.
It is a super-2 number, since 2×1461327364472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146132736396 and 146132736405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146132736047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24355456072 + ... + 24355456077.
It is an arithmetic number, because the mean of its divisors is an integer number (48710912150).
Almost surely, 2146132736447 is an apocalyptic number.
146132736447 is a deficient number, since it is larger than the sum of its proper divisors (48710912153).
146132736447 is an equidigital number, since it uses as much as digits as its factorization.
146132736447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48710912152.
The product of its digits is 2032128, while the sum is 48.
The spelling of 146132736447 in words is "one hundred forty-six billion, one hundred thirty-two million, seven hundred thirty-six thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •