Base | Representation |
---|---|
bin | 11110111000011101101… |
… | …10100111100100110101 |
3 | 10202102220022101000000012 |
4 | 33130032312213210311 |
5 | 114341121131333023 |
6 | 2131244310430005 |
7 | 136443125132231 |
oct | 17341666474465 |
9 | 3672808330005 |
10 | 1061106121013 |
11 | 37a015819054 |
12 | 151796362305 |
13 | 790a5c3a7b3 |
14 | 39501b8d5c1 |
15 | 1c90615d978 |
hex | f70eda7935 |
1061106121013 has 8 divisors (see below), whose sum is σ = 1084082418048. Its totient is φ = 1038146472864.
The previous prime is 1061106120973. The next prime is 1061106121021. The reversal of 1061106121013 is 3101216011601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1061106121013 - 210 = 1061106119989 is a prime.
It is a super-2 number, since 2×10611061210132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1061106121013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1061106121213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4033331 + ... + 4288352.
It is an arithmetic number, because the mean of its divisors is an integer number (135510302256).
Almost surely, 21061106121013 is an apocalyptic number.
It is an amenable number.
1061106121013 is a deficient number, since it is larger than the sum of its proper divisors (22976297035).
1061106121013 is an equidigital number, since it uses as much as digits as its factorization.
1061106121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8324443.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 1061106121013 in words is "one trillion, sixty-one billion, one hundred six million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •