Base | Representation |
---|---|
bin | 1110010111000… |
… | …10100011011111 |
3 | 22101200021210001 |
4 | 13023202203133 |
5 | 221314400011 |
6 | 15541555131 |
7 | 2661640516 |
oct | 713424337 |
9 | 271607701 |
10 | 120465631 |
11 | 61aaa680 |
12 | 34415aa7 |
13 | 1bc5ab50 |
14 | 11ddb67d |
15 | a8987c1 |
hex | 72e28df |
120465631 has 8 divisors (see below), whose sum is σ = 141526224. Its totient is φ = 101089920.
The previous prime is 120465593. The next prime is 120465637. The reversal of 120465631 is 136564021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120465631 - 213 = 120457439 is a prime.
It is a super-2 number, since 2×1204656312 = 29023936504456322, which contains 22 as substring.
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 120465631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120465637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 421066 + ... + 421351.
It is an arithmetic number, because the mean of its divisors is an integer number (17690778).
Almost surely, 2120465631 is an apocalyptic number.
120465631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120465631 is a deficient number, since it is larger than the sum of its proper divisors (21060593).
120465631 is a wasteful number, since it uses less digits than its factorization.
120465631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842441.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 120465631 is about 10975.6836233558. The cubic root of 120465631 is about 493.8795608086.
The spelling of 120465631 in words is "one hundred twenty million, four hundred sixty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •