Base | Representation |
---|---|
bin | 1000011101110000000… |
… | …1010100101001111011 |
3 | 111220100221021101112212 |
4 | 2013130001110221323 |
5 | 4340312331130120 |
6 | 150450223525335 |
7 | 13335526162244 |
oct | 2073401245173 |
9 | 456327241485 |
10 | 145425255035 |
11 | 56746846595 |
12 | 2422675984b |
13 | 10937865488 |
14 | 7077d89ccb |
15 | 3bb21796c5 |
hex | 21dc054a7b |
145425255035 has 4 divisors (see below), whose sum is σ = 174510306048. Its totient is φ = 116340204024.
The previous prime is 145425255023. The next prime is 145425255037. The reversal of 145425255035 is 530552524541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 145425255035 - 218 = 145424992891 is a prime.
It is a super-2 number, since 2×1454252550352 (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 = 145425254983 and 145425255001.
It is not an unprimeable number, because it can be changed into a prime (145425255037) 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, 14542525499 + ... + 14542525508.
It is an arithmetic number, because the mean of its divisors is an integer number (43627576512).
Almost surely, 2145425255035 is an apocalyptic number.
145425255035 is a deficient number, since it is larger than the sum of its proper divisors (29085051013).
145425255035 is an equidigital number, since it uses as much as digits as its factorization.
145425255035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29085051012.
The product of its (nonzero) digits is 600000, while the sum is 41.
Adding to 145425255035 its reverse (530552524541), we get a palindrome (675977779576).
The spelling of 145425255035 in words is "one hundred forty-five billion, four hundred twenty-five million, two hundred fifty-five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •