Base | Representation |
---|---|
bin | 111101110001101… |
… | …000110000001011 |
3 | 2200020012200220202 |
4 | 331301220300023 |
5 | 4110311002110 |
6 | 250502042415 |
7 | 34453304636 |
oct | 7561506013 |
9 | 2606180822 |
10 | 1036422155 |
11 | 49204033a |
12 | 24b11940b |
13 | 136950362 |
14 | 9b90cc1d |
15 | 60ec80a5 |
hex | 3dc68c0b |
1036422155 has 32 divisors (see below), whose sum is σ = 1320753600. Its totient is φ = 779530752.
The previous prime is 1036422151. The next prime is 1036422157. The reversal of 1036422155 is 5512246301.
1036422155 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1036422155 - 22 = 1036422151 is a prime.
It is a super-3 number, since 3×10364221553 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (1036422151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1206116 + ... + 1206974.
It is an arithmetic number, because the mean of its divisors is an integer number (41273550).
Almost surely, 21036422155 is an apocalyptic number.
1036422155 is a deficient number, since it is larger than the sum of its proper divisors (284331445).
1036422155 is a wasteful number, since it uses less digits than its factorization.
1036422155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 1036422155 is about 32193.5110697793. The cubic root of 1036422155 is about 1011.9962332631.
Adding to 1036422155 its reverse (5512246301), we get a palindrome (6548668456).
The spelling of 1036422155 in words is "one billion, thirty-six million, four hundred twenty-two thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •