Base | Representation |
---|---|
bin | 111100010101000… |
… | …001010101111001 |
3 | 2121112112012211121 |
4 | 330111001111321 |
5 | 4033102042411 |
6 | 244233425241 |
7 | 34040035426 |
oct | 7425012571 |
9 | 2545465747 |
10 | 1012143481 |
11 | 47a368418 |
12 | 242b6b221 |
13 | 1318cc58b |
14 | 985ccd4d |
15 | 5dcce571 |
hex | 3c541579 |
1012143481 has 2 divisors, whose sum is σ = 1012143482. Its totient is φ = 1012143480.
The previous prime is 1012143469. The next prime is 1012143527. The reversal of 1012143481 is 1843412101.
1012143481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 899040256 + 113103225 = 29984^2 + 10635^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012143481 - 215 = 1012110713 is a prime.
It is a super-2 number, since 2×10121434812 = 2048868852261594722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1012143401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506071740 + 506071741.
It is an arithmetic number, because the mean of its divisors is an integer number (506071741).
Almost surely, 21012143481 is an apocalyptic number.
It is an amenable number.
1012143481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012143481 is an equidigital number, since it uses as much as digits as its factorization.
1012143481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 25.
The square root of 1012143481 is about 31814.2025045419. The cubic root of 1012143481 is about 1004.0315517483.
Adding to 1012143481 its reverse (1843412101), we get a palindrome (2855555582).
The spelling of 1012143481 in words is "one billion, twelve million, one hundred forty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •