Base | Representation |
---|---|
bin | 1110100011001… |
… | …01111011011011 |
3 | 22111122220022010 |
4 | 13101211323123 |
5 | 222221133230 |
6 | 20040001003 |
7 | 3011266440 |
oct | 721457333 |
9 | 274586263 |
10 | 122052315 |
11 | 62993790 |
12 | 34a60163 |
13 | 1c395108 |
14 | 122d19c7 |
15 | aaad9b0 |
hex | 7465edb |
122052315 has 32 divisors (see below), whose sum is σ = 243472896. Its totient is φ = 50722560.
The previous prime is 122052313. The next prime is 122052349. The reversal of 122052315 is 513250221.
It is not a de Polignac number, because 122052315 - 21 = 122052313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 122052291 and 122052300.
It is not an unprimeable number, because it can be changed into a prime (122052311) 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 31 ways as a sum of consecutive naturals, for example, 51682 + ... + 53991.
It is an arithmetic number, because the mean of its divisors is an integer number (7608528).
Almost surely, 2122052315 is an apocalyptic number.
122052315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
122052315 is a deficient number, since it is larger than the sum of its proper divisors (121420581).
122052315 is a wasteful number, since it uses less digits than its factorization.
122052315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105699.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 122052315 is about 11047.7289521422. The cubic root of 122052315 is about 496.0384484481.
It can be divided in two parts, 1220 and 52315, that added together give a palindrome (53535).
The spelling of 122052315 in words is "one hundred twenty-two million, fifty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •