Base | Representation |
---|---|
bin | 111110101010011… |
… | …010010001001010 |
3 | 2201021012211101111 |
4 | 332222122101022 |
5 | 4123113230114 |
6 | 252153040534 |
7 | 35023642153 |
oct | 7652322112 |
9 | 2637184344 |
10 | 1051305034 |
11 | 49a48603a |
12 | 2540b614a |
13 | 139a615b0 |
14 | 9d8a492a |
15 | 62467bc4 |
hex | 3ea9a44a |
1051305034 has 8 divisors (see below), whose sum is σ = 1698262020. Its totient is φ = 485217696.
The previous prime is 1051305029. The next prime is 1051305037. The reversal of 1051305034 is 4305031501.
It is a happy number.
1051305034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 999508225 + 51796809 = 31615^2 + 7197^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10513050342 = 2210484549027482312, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1051304996 and 1051305014.
It is not an unprimeable number, because it can be changed into a prime (1051305037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20217379 + ... + 20217430.
Almost surely, 21051305034 is an apocalyptic number.
1051305034 is a deficient number, since it is larger than the sum of its proper divisors (646956986).
1051305034 is a wasteful number, since it uses less digits than its factorization.
1051305034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40434824.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 1051305034 is about 32423.8343506748. The cubic root of 1051305034 is about 1016.8172719406.
Adding to 1051305034 its reverse (4305031501), we get a palindrome (5356336535).
The spelling of 1051305034 in words is "one billion, fifty-one million, three hundred five thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •