Base | Representation |
---|---|
bin | 111110110101010… |
… | …001101011011000 |
3 | 2201110120112122201 |
4 | 332311101223120 |
5 | 4124330402212 |
6 | 252334055544 |
7 | 35060104423 |
oct | 7665215330 |
9 | 2643515581 |
10 | 1054153432 |
11 | 4a1051092 |
12 | 25504a5b4 |
13 | 13a51ac37 |
14 | a00069ba |
15 | 6282bb57 |
hex | 3ed51ad8 |
1054153432 has 32 divisors (see below), whose sum is σ = 1993662720. Its totient is φ = 522528160.
The previous prime is 1054153423. The next prime is 1054153433. The reversal of 1054153432 is 2343514501.
It is a super-2 number, since 2×10541534322 = 2222478916394757248, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1054153432.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054153433) 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 7 ways as a sum of consecutive naturals, for example, 655173 + ... + 656779.
It is an arithmetic number, because the mean of its divisors is an integer number (62301960).
Almost surely, 21054153432 is an apocalyptic number.
It is an amenable number.
1054153432 is a deficient number, since it is larger than the sum of its proper divisors (939509288).
1054153432 is a wasteful number, since it uses less digits than its factorization.
1054153432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2271 (or 2267 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 1054153432 is about 32467.7290859709. The cubic root of 1054153432 is about 1017.7347628629.
Adding to 1054153432 its reverse (2343514501), we get a palindrome (3397667933).
The spelling of 1054153432 in words is "one billion, fifty-four million, one hundred fifty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •