Base | Representation |
---|---|
bin | 101100000110011001101… |
… | …1000110100101101000010 |
3 | 210110102122202120202000211 |
4 | 1120030303120310231002 |
5 | 1243301023104000002 |
6 | 20520225112104334 |
7 | 1163616512310301 |
oct | 130146330645502 |
9 | 23412582522024 |
10 | 6061061000002 |
11 | 1a27532a17518 |
12 | 81a8110950aa |
13 | 34c72b864328 |
14 | 16d4dd54c438 |
15 | a79de91add7 |
hex | 58333634b42 |
6061061000002 has 4 divisors (see below), whose sum is σ = 9091591500006. Its totient is φ = 3030530500000.
The previous prime is 6061060999943. The next prime is 6061061000003. The reversal of 6061061000002 is 2000001601606.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 5280716676361 + 780344323641 = 2297981^2 + 883371^2 .
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (6061061000003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515265249999 + ... + 1515265250002.
Almost surely, 26061061000002 is an apocalyptic number.
6061061000002 is a deficient number, since it is larger than the sum of its proper divisors (3030530500004).
6061061000002 is a wasteful number, since it uses less digits than its factorization.
6061061000002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3030530500003.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 6061061000002 its reverse (2000001601606), we get a palindrome (8061062601608).
The spelling of 6061061000002 in words is "six trillion, sixty-one billion, sixty-one million, two", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •