Base | Representation |
---|---|
bin | 111100110010011011… |
… | …0110001110110000111 |
3 | 110110221122002222212020 |
4 | 1321210312301312013 |
5 | 4114322010203143 |
6 | 135545244454223 |
7 | 12300634021416 |
oct | 1714466616607 |
9 | 413848088766 |
10 | 130541100423 |
11 | 503a9058968 |
12 | 21371b4a373 |
13 | c40501a2b6 |
14 | 64652bd47d |
15 | 35e05e9883 |
hex | 1e64db1d87 |
130541100423 has 4 divisors (see below), whose sum is σ = 174054800568. Its totient is φ = 87027400280.
The previous prime is 130541100421. The next prime is 130541100433. The reversal of 130541100423 is 324001145031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 324001145031 = 3 ⋅108000381677.
It is a cyclic number.
It is not a de Polignac number, because 130541100423 - 21 = 130541100421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130541100393 and 130541100402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130541100421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21756850068 + ... + 21756850073.
It is an arithmetic number, because the mean of its divisors is an integer number (43513700142).
Almost surely, 2130541100423 is an apocalyptic number.
130541100423 is a deficient number, since it is larger than the sum of its proper divisors (43513700145).
130541100423 is an equidigital number, since it uses as much as digits as its factorization.
130541100423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43513700144.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 130541100423 its reverse (324001145031), we get a palindrome (454542245454).
The spelling of 130541100423 in words is "one hundred thirty billion, five hundred forty-one million, one hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •