Base | Representation |
---|---|
bin | 100010010100010… |
… | …1011001101010111 |
3 | 2222020202221110121 |
4 | 1010220223031113 |
5 | 4324241412211 |
6 | 310132532411 |
7 | 40351463005 |
oct | 10450531527 |
9 | 2866687417 |
10 | 1151513431 |
11 | 540aaa0a2 |
12 | 281781107 |
13 | 154748bc3 |
14 | acd0ba75 |
15 | 6b15e271 |
hex | 44a2b357 |
1151513431 has 8 divisors (see below), whose sum is σ = 1160297424. Its totient is φ = 1142754240.
The previous prime is 1151513381. The next prime is 1151513437. The reversal of 1151513431 is 1343151511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1151513431 - 27 = 1151513303 is a prime.
It is a super-2 number, since 2×11515134312 = 2651966363546783522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1151513396 and 1151513405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151513437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92955 + ... + 104611.
It is an arithmetic number, because the mean of its divisors is an integer number (145037178).
Almost surely, 21151513431 is an apocalyptic number.
1151513431 is a deficient number, since it is larger than the sum of its proper divisors (8783993).
1151513431 is a wasteful number, since it uses less digits than its factorization.
1151513431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12401.
The product of its digits is 900, while the sum is 25.
The square root of 1151513431 is about 33933.9569016052. The cubic root of 1151513431 is about 1048.1489476034.
Adding to 1151513431 its reverse (1343151511), we get a palindrome (2494664942).
The spelling of 1151513431 in words is "one billion, one hundred fifty-one million, five hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •