Base | Representation |
---|---|
bin | 1000010010110101… |
… | …11011011011100101 |
3 | 102111100010221000000 |
4 | 10021122323123211 |
5 | 33104433141123 |
6 | 2013511411513 |
7 | 215231025501 |
oct | 41132733345 |
9 | 12440127000 |
10 | 4453021413 |
11 | 1985683995 |
12 | a43383b99 |
13 | 55c738719 |
14 | 30359b301 |
15 | 1b0e0db43 |
hex | 1096bb6e5 |
4453021413 has 14 divisors (see below), whose sum is σ = 6676479014. Its totient is φ = 2968680456.
The previous prime is 4453021409. The next prime is 4453021451. The reversal of 4453021413 is 3141203544.
It is a happy number.
4453021413 is a `hidden beast` number, since 445 + 3 + 0 + 214 + 1 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4318855524 + 134165889 = 65718^2 + 11583^2 .
It is not a de Polignac number, because 4453021413 - 22 = 4453021409 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4453021403) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 3053470 + ... + 3054927.
Almost surely, 24453021413 is an apocalyptic number.
It is an amenable number.
4453021413 is a deficient number, since it is larger than the sum of its proper divisors (2223457601).
4453021413 is an frugal number, since it uses more digits than its factorization.
4453021413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6108415 (or 6108400 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 4453021413 is about 66730.9629257663. The cubic root of 4453021413 is about 1645.1983344409.
Adding to 4453021413 its reverse (3141203544), we get a palindrome (7594224957).
The spelling of 4453021413 in words is "four billion, four hundred fifty-three million, twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •