Base | Representation |
---|---|
bin | 1111100010100… |
… | …11011111101111 |
3 | 100002022020202000 |
4 | 13301103133233 |
5 | 231333143143 |
6 | 20534103343 |
7 | 3142042056 |
oct | 761233757 |
9 | 302266660 |
10 | 130365423 |
11 | 67651521 |
12 | 377aab53 |
13 | 21015c06 |
14 | 1345739d |
15 | b6a1bd3 |
hex | 7c537ef |
130365423 has 8 divisors (see below), whose sum is σ = 193134000. Its totient is φ = 86910264.
The previous prime is 130365413. The next prime is 130365427. The reversal of 130365423 is 324563031.
It is a happy number.
130365423 is a `hidden beast` number, since 1 + 3 + 0 + 3 + 654 + 2 + 3 = 666.
It is not a de Polignac number, because 130365423 - 24 = 130365407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4828349 = 130365423 / (1 + 3 + 0 + 3 + 6 + 5 + 4 + 2 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130365427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2414148 + ... + 2414201.
It is an arithmetic number, because the mean of its divisors is an integer number (24141750).
Almost surely, 2130365423 is an apocalyptic number.
130365423 is a deficient number, since it is larger than the sum of its proper divisors (62768577).
130365423 is an equidigital number, since it uses as much as digits as its factorization.
130365423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4828358 (or 4828352 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 130365423 is about 11417.7678641668. The cubic root of 130365423 is about 507.0539139473.
The spelling of 130365423 in words is "one hundred thirty million, three hundred sixty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •