Base | Representation |
---|---|
bin | 1111100110111… |
… | …11111000010001 |
3 | 100010101110111200 |
4 | 13303133320101 |
5 | 232010043213 |
6 | 20554301413 |
7 | 3146655351 |
oct | 763377021 |
9 | 303343450 |
10 | 130940433 |
11 | 67a04538 |
12 | 37a27869 |
13 | 21187860 |
14 | 13566b61 |
15 | b767273 |
hex | 7cdfe11 |
130940433 has 24 divisors (see below), whose sum is σ = 204247680. Its totient is φ = 80356320.
The previous prime is 130940431. The next prime is 130940437. The reversal of 130940433 is 334049031.
It is not a de Polignac number, because 130940433 - 21 = 130940431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130940397 and 130940406.
It is not an unprimeable number, because it can be changed into a prime (130940431) 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 23 ways as a sum of consecutive naturals, for example, 47688 + ... + 50358.
It is an arithmetic number, because the mean of its divisors is an integer number (8510320).
Almost surely, 2130940433 is an apocalyptic number.
130940433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130940433 is a deficient number, since it is larger than the sum of its proper divisors (73307247).
130940433 is a wasteful number, since it uses less digits than its factorization.
130940433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3109 (or 3106 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 130940433 is about 11442.9206499040. The cubic root of 130940433 is about 507.7983174952.
Adding to 130940433 its reverse (334049031), we get a palindrome (464989464).
The spelling of 130940433 in words is "one hundred thirty million, nine hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •