Base | Representation |
---|---|
bin | 111110111011100… |
… | …010001001000100 |
3 | 2201120122212201120 |
4 | 332323202021010 |
5 | 4130240344412 |
6 | 252433153540 |
7 | 35110045560 |
oct | 7673421104 |
9 | 2646585646 |
10 | 1055793732 |
11 | 4a1a71504 |
12 | 2556bb8b0 |
13 | 13a973726 |
14 | a03126a0 |
15 | 62a52b8c |
hex | 3eee2244 |
1055793732 has 24 divisors (see below), whose sum is σ = 2815450176. Its totient is φ = 301655328.
The previous prime is 1055793719. The next prime is 1055793751. The reversal of 1055793732 is 2373975501.
1055793732 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10557937322 = 2229400809060975648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6284403 + ... + 6284570.
It is an arithmetic number, because the mean of its divisors is an integer number (117310424).
Almost surely, 21055793732 is an apocalyptic number.
1055793732 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1055793732 is an abundant number, since it is smaller than the sum of its proper divisors (1759656444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055793732 is a wasteful number, since it uses less digits than its factorization.
1055793732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12568987 (or 12568985 counting only the distinct ones).
The product of its (nonzero) digits is 198450, while the sum is 42.
The square root of 1055793732 is about 32492.9797340903. The cubic root of 1055793732 is about 1018.2623663888.
The spelling of 1055793732 in words is "one billion, fifty-five million, seven hundred ninety-three thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •