Base | Representation |
---|---|
bin | 111100101011111101… |
… | …1011111100010000011 |
3 | 110110101112000221202101 |
4 | 1321113323133202003 |
5 | 4113401000413243 |
6 | 135511540331231 |
7 | 12262361461045 |
oct | 1712773374203 |
9 | 413345027671 |
10 | 130324232323 |
11 | 502a76a472a |
12 | 213113a3b17 |
13 | c39c10828c |
14 | 6444589a95 |
15 | 35cb55c54d |
hex | 1e57edf883 |
130324232323 has 8 divisors (see below), whose sum is σ = 131776379280. Its totient is φ = 128880131040.
The previous prime is 130324232309. The next prime is 130324232341. The reversal of 130324232323 is 323232423031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130324232323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130324232291 and 130324232300.
It is not an unprimeable number, because it can be changed into a prime (130324232303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1978840 + ... + 2043637.
It is an arithmetic number, because the mean of its divisors is an integer number (16472047410).
Almost surely, 2130324232323 is an apocalyptic number.
130324232323 is a deficient number, since it is larger than the sum of its proper divisors (1452146957).
130324232323 is a wasteful number, since it uses less digits than its factorization.
130324232323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4022837.
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 130324232323 its reverse (323232423031), we get a palindrome (453556655354).
The spelling of 130324232323 in words is "one hundred thirty billion, three hundred twenty-four million, two hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •