Base | Representation |
---|---|
bin | 1000011110000111111… |
… | …1001100101011111011 |
3 | 111220121220122022200010 |
4 | 2013201333030223323 |
5 | 4341013443031103 |
6 | 150504201313003 |
7 | 13341153106452 |
oct | 2074177145373 |
9 | 456556568603 |
10 | 145525361403 |
11 | 567982aaa24 |
12 | 24254195763 |
13 | 10952515506 |
14 | 70873a7b99 |
15 | 3bbad50903 |
hex | 21e1fccafb |
145525361403 has 8 divisors (see below), whose sum is σ = 194252571648. Its totient is φ = 96907529384.
The previous prime is 145525361327. The next prime is 145525361411. The reversal of 145525361403 is 304163525541.
It is a happy number.
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 145525361403 - 28 = 145525361147 is a prime.
It is a super-2 number, since 2×1455253614032 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145525361453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27341451 + ... + 27346772.
It is an arithmetic number, because the mean of its divisors is an integer number (24281571456).
Almost surely, 2145525361403 is an apocalyptic number.
145525361403 is a deficient number, since it is larger than the sum of its proper divisors (48727210245).
145525361403 is an equidigital number, since it uses as much as digits as its factorization.
145525361403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54689113.
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 145525361403 its reverse (304163525541), we get a palindrome (449688886944).
The spelling of 145525361403 in words is "one hundred forty-five billion, five hundred twenty-five million, three hundred sixty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •