Base | Representation |
---|---|
bin | 10001010111000… |
… | …00100010100111 |
3 | 101011000102111010 |
4 | 20223200202213 |
5 | 244234420312 |
6 | 22241113303 |
7 | 3415530312 |
oct | 1053404247 |
9 | 334012433 |
10 | 145623207 |
11 | 75222964 |
12 | 40928833 |
13 | 242289a2 |
14 | 154a9979 |
15 | cbb793c |
hex | 8ae08a7 |
145623207 has 8 divisors (see below), whose sum is σ = 205585776. Its totient is φ = 91371392.
The previous prime is 145623199. The next prime is 145623259. The reversal of 145623207 is 702326541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145623207 - 23 = 145623199 is a prime.
It is a super-2 number, since 2×1456232072 = 42412236833929698, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145624207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1427628 + ... + 1427729.
It is an arithmetic number, because the mean of its divisors is an integer number (25698222).
Almost surely, 2145623207 is an apocalyptic number.
145623207 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
145623207 is a deficient number, since it is larger than the sum of its proper divisors (59962569).
145623207 is a wasteful number, since it uses less digits than its factorization.
145623207 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2855377.
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 145623207 is about 12067.4440955821. Note that the first 3 decimals coincide. The cubic root of 145623207 is about 526.1103719098.
Adding to 145623207 its reverse (702326541), we get a palindrome (847949748).
The spelling of 145623207 in words is "one hundred forty-five million, six hundred twenty-three thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •