Base | Representation |
---|---|
bin | 11000111110101… |
… | …000000010011001 |
3 | 1002012112222010000 |
4 | 120332220002121 |
5 | 1324240220410 |
6 | 105330043213 |
7 | 13246015506 |
oct | 3076500231 |
9 | 1065488100 |
10 | 419070105 |
11 | 1a5610633 |
12 | b8419509 |
13 | 68a8a69c |
14 | 3d92a4ad |
15 | 26bcddc0 |
hex | 18fa8099 |
419070105 has 40 divisors (see below), whose sum is σ = 757952712. Its totient is φ = 221501952.
The previous prime is 419070083. The next prime is 419070107. The reversal of 419070105 is 501070914.
It can be written as a sum of positive squares in 4 ways, for example, as 18429849 + 400640256 = 4293^2 + 20016^2 .
It is not a de Polignac number, because 419070105 - 212 = 419066009 is a prime.
It is a super-2 number, since 2×4190701052 = 351239505809422050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (419070107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 41187 + ... + 50343.
Almost surely, 2419070105 is an apocalyptic number.
419070105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
419070105 is a deficient number, since it is larger than the sum of its proper divisors (338882607).
419070105 is a wasteful number, since it uses less digits than its factorization.
419070105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9287 (or 9278 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 419070105 is about 20471.2018455195. The cubic root of 419070105 is about 748.3341426318.
The spelling of 419070105 in words is "four hundred nineteen million, seventy thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •