Base | Representation |
---|---|
bin | 1001010100010010011… |
… | …11000010010010001111 |
3 | 1010121022102001222111020 |
4 | 10222021033002102033 |
5 | 20221111240000030 |
6 | 403022104525223 |
7 | 32062056050130 |
oct | 4521117022217 |
9 | 1117272058436 |
10 | 320130000015 |
11 | 113848048251 |
12 | 52062a80813 |
13 | 2425a422017 |
14 | 116cc7c7c87 |
15 | 84d9a58510 |
hex | 4a893c248f |
320130000015 has 32 divisors (see below), whose sum is σ = 585449610240. Its totient is φ = 146327883264.
The previous prime is 320129999963. The next prime is 320130000053. The reversal of 320130000015 is 510000031023.
It is a happy number.
It is not a de Polignac number, because 320130000015 - 26 = 320129999951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 320129999949 and 320130000003.
It is a congruent number.
It is an unprimeable number.
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, 736902 + ... + 1087788.
It is an arithmetic number, because the mean of its divisors is an integer number (18295300320).
Almost surely, 2320130000015 is an apocalyptic number.
320130000015 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
320130000015 is a deficient number, since it is larger than the sum of its proper divisors (265319610225).
320130000015 is a wasteful number, since it uses less digits than its factorization.
320130000015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359591.
The product of its (nonzero) digits is 90, while the sum is 15.
Adding to 320130000015 its reverse (510000031023), we get a palindrome (830130031038).
The spelling of 320130000015 in words is "three hundred twenty billion, one hundred thirty million, fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •