Base | Representation |
---|---|
bin | 111111100100100… |
… | …100001100001111 |
3 | 2202022220100121000 |
4 | 333210210030033 |
5 | 4141014100111 |
6 | 253455511343 |
7 | 35300345211 |
oct | 7744441417 |
9 | 2668810530 |
10 | 1066550031 |
11 | 4a8048908 |
12 | 259228553 |
13 | 13cc6b5c1 |
14 | a19125b1 |
15 | 63979c56 |
hex | 3f92430f |
1066550031 has 16 divisors (see below), whose sum is σ = 1580796000. Its totient is φ = 710708544.
The previous prime is 1066549973. The next prime is 1066550087. The reversal of 1066550031 is 1300556601.
It is a happy number.
1066550031 is a `hidden beast` number, since 1 + 0 + 6 + 655 + 0 + 0 + 3 + 1 = 666.
It is not a de Polignac number, because 1066550031 - 211 = 1066547983 is a prime.
It is a super-2 number, since 2×10665500312 = 2275057937252201922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1066549977 and 1066550004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066550531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61075 + ... + 76571.
It is an arithmetic number, because the mean of its divisors is an integer number (98799750).
Almost surely, 21066550031 is an apocalyptic number.
1066550031 is a deficient number, since it is larger than the sum of its proper divisors (514245969).
1066550031 is a wasteful number, since it uses less digits than its factorization.
1066550031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18055 (or 18049 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 1066550031 is about 32658.0775766119. The cubic root of 1066550031 is about 1021.7086672458.
The spelling of 1066550031 in words is "one billion, sixty-six million, five hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •