Base | Representation |
---|---|
bin | 10001011000001… |
… | …00000000110000 |
3 | 101011021210210012 |
4 | 20230010000300 |
5 | 244304042441 |
6 | 22244154052 |
7 | 3420004016 |
oct | 1054040060 |
9 | 334253705 |
10 | 145768496 |
11 | 75312035 |
12 | 40998928 |
13 | 24279b63 |
14 | 155068b6 |
15 | cbe59eb |
hex | 8b04030 |
145768496 has 20 divisors (see below), whose sum is σ = 285341112. Its totient is φ = 72132096.
The previous prime is 145768477. The next prime is 145768507. The reversal of 145768496 is 694867541.
It is a super-2 number, since 2×1457684962 = 42496908852204032, which contains 22 as substring.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45410 + ... + 48513.
Almost surely, 2145768496 is an apocalyptic number.
145768496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
145768496 is a deficient number, since it is larger than the sum of its proper divisors (139572616).
145768496 is an equidigital number, since it uses as much as digits as its factorization.
145768496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94028 (or 94022 counting only the distinct ones).
The product of its digits is 1451520, while the sum is 50.
The square root of 145768496 is about 12073.4624693996. The cubic root of 145768496 is about 526.2852814007.
The spelling of 145768496 in words is "one hundred forty-five million, seven hundred sixty-eight thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •