Base | Representation |
---|---|
bin | 101001001000011… |
… | …0111101101111001 |
3 | 10120012000002200110 |
4 | 1102100313231321 |
5 | 10311304413413 |
6 | 344541254533 |
7 | 46126055163 |
oct | 12220675571 |
9 | 3505002613 |
10 | 1380154233 |
11 | 649074337 |
12 | 326264449 |
13 | 18cc20613 |
14 | d1427933 |
15 | 812748c3 |
hex | 52437b79 |
1380154233 has 4 divisors (see below), whose sum is σ = 1840205648. Its totient is φ = 920102820.
The previous prime is 1380154211. The next prime is 1380154249. The reversal of 1380154233 is 3324510831.
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.
It is not a de Polignac number, because 1380154233 - 210 = 1380153209 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1380154233.
It is not an unprimeable number, because it can be changed into a prime (1380153233) 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, 230025703 + ... + 230025708.
It is an arithmetic number, because the mean of its divisors is an integer number (460051412).
Almost surely, 21380154233 is an apocalyptic number.
It is an amenable number.
1380154233 is a deficient number, since it is larger than the sum of its proper divisors (460051415).
1380154233 is an equidigital number, since it uses as much as digits as its factorization.
1380154233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460051414.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 1380154233 is about 37150.4270904118. The cubic root of 1380154233 is about 1113.3777565929.
The spelling of 1380154233 in words is "one billion, three hundred eighty million, one hundred fifty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •