Base | Representation |
---|---|
bin | 10001010010100… |
… | …11011110110011 |
3 | 101002221001220212 |
4 | 20221103132303 |
5 | 244112423202 |
6 | 22220454335 |
7 | 3410602652 |
oct | 1051233663 |
9 | 332831825 |
10 | 145045427 |
11 | 7496885a |
12 | 406aa3ab |
13 | 240859c7 |
14 | 15399199 |
15 | cb01652 |
hex | 8a537b3 |
145045427 has 4 divisors (see below), whose sum is σ = 146152776. Its totient is φ = 143938080.
The previous prime is 145045339. The next prime is 145045451. The reversal of 145045427 is 724540541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 724540541 = 263 ⋅2754907.
It is a cyclic number.
It is not a de Polignac number, because 145045427 - 28 = 145045171 is a prime.
It is a super-2 number, since 2×1450454272 = 42076351787224658, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145045393 and 145045402.
It is not an unprimeable number, because it can be changed into a prime (145048427) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553478 + ... + 553739.
It is an arithmetic number, because the mean of its divisors is an integer number (36538194).
Almost surely, 2145045427 is an apocalyptic number.
145045427 is a deficient number, since it is larger than the sum of its proper divisors (1107349).
145045427 is a wasteful number, since it uses less digits than its factorization.
145045427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1107348.
The product of its (nonzero) digits is 22400, while the sum is 32.
The square root of 145045427 is about 12043.4806845862. The cubic root of 145045427 is about 525.4136446787.
Adding to 145045427 its reverse (724540541), we get a palindrome (869585968).
The spelling of 145045427 in words is "one hundred forty-five million, forty-five thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •