Base | Representation |
---|---|
bin | 1000011110011001110… |
… | …1100001100101111101 |
3 | 111220211010212201000100 |
4 | 2013212131201211331 |
5 | 4341142201421341 |
6 | 150515442151313 |
7 | 13343054103024 |
oct | 2074635414575 |
9 | 456733781010 |
10 | 145600420221 |
11 | 56826706803 |
12 | 24275352539 |
13 | 10964c35809 |
14 | 70933458bb |
15 | 3bc272a3b6 |
hex | 21e676197d |
145600420221 has 12 divisors (see below), whose sum is σ = 210315981148. Its totient is φ = 97064979264.
The previous prime is 145600420213. The next prime is 145600420243. The reversal of 145600420221 is 122024006541.
145600420221 is a `hidden beast` number, since 1 + 456 + 0 + 0 + 4 + 202 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 141019025625 + 4581394596 = 375525^2 + 67686^2 .
It is not a de Polignac number, because 145600420221 - 23 = 145600420213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145600420211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 410721 + ... + 678153.
Almost surely, 2145600420221 is an apocalyptic number.
It is an amenable number.
145600420221 is a deficient number, since it is larger than the sum of its proper divisors (64715560927).
145600420221 is a wasteful number, since it uses less digits than its factorization.
145600420221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327932 (or 327929 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 145600420221 its reverse (122024006541), we get a palindrome (267624426762).
It can be divided in two parts, 1456004 and 20221, that added together give a square (1476225 = 12152).
The spelling of 145600420221 in words is "one hundred forty-five billion, six hundred million, four hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •