Base | Representation |
---|---|
bin | 111110010011101… |
… | …011000010010010 |
3 | 2200211222222221100 |
4 | 332103223002102 |
5 | 4120102010102 |
6 | 251421205230 |
7 | 34622165214 |
oct | 7623530222 |
9 | 2624888840 |
10 | 1045344402 |
11 | 4970847a3 |
12 | 252100816 |
13 | 1387554ab |
14 | 9cb925b4 |
15 | 61b8ba1c |
hex | 3e4eb092 |
1045344402 has 12 divisors (see below), whose sum is σ = 2264912910. Its totient is φ = 348448128.
The previous prime is 1045344367. The next prime is 1045344409. The reversal of 1045344402 is 2044435401.
It is a happy number.
1045344402 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1030987881 + 14356521 = 32109^2 + 3789^2 .
It is not an unprimeable number, because it can be changed into a prime (1045344409) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 29037327 + ... + 29037362.
Almost surely, 21045344402 is an apocalyptic number.
1045344402 is an abundant number, since it is smaller than the sum of its proper divisors (1219568508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1045344402 is a wasteful number, since it uses less digits than its factorization.
1045344402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58074697 (or 58074694 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 27.
The square root of 1045344402 is about 32331.7862482109. The cubic root of 1045344402 is about 1014.8919302219.
Adding to 1045344402 its reverse (2044435401), we get a palindrome (3089779803).
Subtracting 1045344402 from its reverse (2044435401), we obtain a palindrome (999090999).
The spelling of 1045344402 in words is "one billion, forty-five million, three hundred forty-four thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •