Base | Representation |
---|---|
bin | 10001010101001… |
… | …00010011011011 |
3 | 101010112220000220 |
4 | 20222210103123 |
5 | 244204021400 |
6 | 22231531123 |
7 | 3413452056 |
oct | 1052442333 |
9 | 333486026 |
10 | 145376475 |
11 | 75074552 |
12 | 40829aa3 |
13 | 241705aa |
14 | 15443a9d |
15 | cb697a0 |
hex | 8aa44db |
145376475 has 24 divisors (see below), whose sum is σ = 241442880. Its totient is φ = 77183520.
The previous prime is 145376437. The next prime is 145376479. The reversal of 145376475 is 574673541.
It is a happy number.
It is not a de Polignac number, because 145376475 - 26 = 145376411 is a prime.
It is a super-2 number, since 2×1453764752 = 42268638966851250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145376479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12756 + ... + 21294.
It is an arithmetic number, because the mean of its divisors is an integer number (10060120).
Almost surely, 2145376475 is an apocalyptic number.
145376475 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145376475 is a deficient number, since it is larger than the sum of its proper divisors (96066405).
145376475 is a wasteful number, since it uses less digits than its factorization.
145376475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8779 (or 8774 counting only the distinct ones).
The product of its digits is 352800, while the sum is 42.
The square root of 145376475 is about 12057.2167186296. The cubic root of 145376475 is about 525.8130712066.
It can be divided in two parts, 14537 and 6475, that added together give a palindrome (21012).
The spelling of 145376475 in words is "one hundred forty-five million, three hundred seventy-six thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •