Base | Representation |
---|---|
bin | 111101110001101… |
… | …000100101010111 |
3 | 2200020012122222010 |
4 | 331301220211113 |
5 | 4110310441323 |
6 | 250502035303 |
7 | 34453302630 |
oct | 7561504527 |
9 | 2606178863 |
10 | 1036421463 |
11 | 49203a870 |
12 | 24b118b33 |
13 | 13694cc4c |
14 | 9b90c887 |
15 | 60ec7c93 |
hex | 3dc68957 |
1036421463 has 16 divisors (see below), whose sum is σ = 1722882816. Its totient is φ = 538400640.
The previous prime is 1036421437. The next prime is 1036421483. The reversal of 1036421463 is 3641246301.
It is not a de Polignac number, because 1036421463 - 25 = 1036421431 is a prime.
It is a super-3 number, since 3×10364214633 (a number of 28 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1036421463.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1036421483) 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, 2243106 + ... + 2243567.
It is an arithmetic number, because the mean of its divisors is an integer number (107680176).
Almost surely, 21036421463 is an apocalyptic number.
1036421463 is a deficient number, since it is larger than the sum of its proper divisors (686461353).
1036421463 is a wasteful number, since it uses less digits than its factorization.
1036421463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4486694.
The product of its (nonzero) digits is 10368, while the sum is 30.
The square root of 1036421463 is about 32193.5003222700. The cubic root of 1036421463 is about 1011.9960080326.
Adding to 1036421463 its reverse (3641246301), we get a palindrome (4677667764).
The spelling of 1036421463 in words is "one billion, thirty-six million, four hundred twenty-one thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •