Base | Representation |
---|---|
bin | 11101010011110100001… |
… | …11010111111100011101 |
3 | 10120021102111221120002121 |
4 | 32221322013113330131 |
5 | 112444440200210301 |
6 | 2050350404422541 |
7 | 132521106054661 |
oct | 16517207277435 |
9 | 3507374846077 |
10 | 1007071100701 |
11 | 359107422576 |
12 | 1432160a7a51 |
13 | 73c742372b3 |
14 | 36a575d08a1 |
15 | 1b2e24273a1 |
hex | ea7a1d7f1d |
1007071100701 has 4 divisors (see below), whose sum is σ = 1007194358304. Its totient is φ = 1006947843100.
The previous prime is 1007071100683. The next prime is 1007071100723. The reversal of 1007071100701 is 1070011707001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1007071100701 - 27 = 1007071100573 is a prime.
It is a super-3 number, since 3×10070711007013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1007071110701) 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, 61616545 + ... + 61632886.
It is an arithmetic number, because the mean of its divisors is an integer number (251798589576).
Almost surely, 21007071100701 is an apocalyptic number.
It is an amenable number.
1007071100701 is a deficient number, since it is larger than the sum of its proper divisors (123257603).
1007071100701 is an equidigital number, since it uses as much as digits as its factorization.
1007071100701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123257602.
The product of its (nonzero) digits is 343, while the sum is 25.
Adding to 1007071100701 its reverse (1070011707001), we get a palindrome (2077082807702).
The spelling of 1007071100701 in words is "one trillion, seven billion, seventy-one million, one hundred thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •