Base | Representation |
---|---|
bin | 111101101001001… |
… | …010110010000101 |
3 | 2200002000220202212 |
4 | 331221022302011 |
5 | 4104223432440 |
6 | 250342313205 |
7 | 34425400616 |
oct | 7551126205 |
9 | 2602026685 |
10 | 1034202245 |
11 | 4908644aa |
12 | 24a428805 |
13 | 136353abb |
14 | 9b4d1c0d |
15 | 60bda465 |
hex | 3da4ac85 |
1034202245 has 32 divisors (see below), whose sum is σ = 1357703424. Its totient is φ = 753984000.
The previous prime is 1034202229. The next prime is 1034202277. The reversal of 1034202245 is 5422024301.
It is a happy number.
1034202245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1034202245 - 24 = 1034202229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1034202245.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 200195 + ... + 205295.
It is an arithmetic number, because the mean of its divisors is an integer number (42428232).
Almost surely, 21034202245 is an apocalyptic number.
It is an amenable number.
1034202245 is a deficient number, since it is larger than the sum of its proper divisors (323501179).
1034202245 is a wasteful number, since it uses less digits than its factorization.
1034202245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5213.
The product of its (nonzero) digits is 1920, while the sum is 23.
The square root of 1034202245 is about 32159.0149880247. The cubic root of 1034202245 is about 1011.2731860595.
Adding to 1034202245 its reverse (5422024301), we get a palindrome (6456226546).
The spelling of 1034202245 in words is "one billion, thirty-four million, two hundred two thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •