Base | Representation |
---|---|
bin | 100100101010111… |
… | …0001101101011101 |
3 | 10011202022002210001 |
4 | 1021111301231131 |
5 | 10004443223110 |
6 | 322032414301 |
7 | 42330420250 |
oct | 11125615535 |
9 | 3152262701 |
10 | 1230445405 |
11 | 581610932 |
12 | 2a40a7391 |
13 | 167bc4107 |
14 | b95b7097 |
15 | 7305163a |
hex | 49571b5d |
1230445405 has 16 divisors (see below), whose sum is σ = 1688385024. Its totient is φ = 843275520.
The previous prime is 1230445399. The next prime is 1230445409. The reversal of 1230445405 is 5045440321.
It is not a de Polignac number, because 1230445405 - 27 = 1230445277 is a prime.
It is a super-3 number, since 3×12304454053 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230445409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63685 + ... + 80725.
It is an arithmetic number, because the mean of its divisors is an integer number (105524064).
Almost surely, 21230445405 is an apocalyptic number.
It is an amenable number.
1230445405 is a deficient number, since it is larger than the sum of its proper divisors (457939619).
1230445405 is a wasteful number, since it uses less digits than its factorization.
1230445405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19116.
The product of its (nonzero) digits is 9600, while the sum is 28.
The square root of 1230445405 is about 35077.7052413638. The cubic root of 1230445405 is about 1071.5705834323.
Adding to 1230445405 its reverse (5045440321), we get a palindrome (6275885726).
The spelling of 1230445405 in words is "one billion, two hundred thirty million, four hundred forty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •