Base | Representation |
---|---|
bin | 101001001001101… |
… | …1011111100110001 |
3 | 10120020021021110010 |
4 | 1102103123330301 |
5 | 10311442430204 |
6 | 345003525133 |
7 | 46134556326 |
oct | 12223337461 |
9 | 3506237403 |
10 | 1380826929 |
11 | 649493789 |
12 | 3265297a9 |
13 | 1900c7871 |
14 | d1560b4d |
15 | 81358d89 |
hex | 524dbf31 |
1380826929 has 4 divisors (see below), whose sum is σ = 1841102576. Its totient is φ = 920551284.
The previous prime is 1380826903. The next prime is 1380826963. The reversal of 1380826929 is 9296280831.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9296280831 = 3 ⋅3098760277.
It is not a de Polignac number, because 1380826929 - 25 = 1380826897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1380826999) 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 3 ways as a sum of consecutive naturals, for example, 230137819 + ... + 230137824.
It is an arithmetic number, because the mean of its divisors is an integer number (460275644).
Almost surely, 21380826929 is an apocalyptic number.
It is an amenable number.
1380826929 is a deficient number, since it is larger than the sum of its proper divisors (460275647).
1380826929 is an equidigital number, since it uses as much as digits as its factorization.
1380826929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460275646.
The product of its (nonzero) digits is 373248, while the sum is 48.
The square root of 1380826929 is about 37159.4796653559. The cubic root of 1380826929 is about 1113.5586163585.
The spelling of 1380826929 in words is "one billion, three hundred eighty million, eight hundred twenty-six thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •