Base | Representation |
---|---|
bin | 101011101001111111101… |
… | …1101110010010001101011 |
3 | 210020121012112002022111002 |
4 | 1113103333131302101223 |
5 | 1241301110421442103 |
6 | 20432220100225215 |
7 | 1156330042265360 |
oct | 127237735622153 |
9 | 23217175068432 |
10 | 6000060343403 |
11 | 1a0367a708335 |
12 | 80aa2809b20b |
13 | 346a599ca159 |
14 | 16a593c1a467 |
15 | a611e407488 |
hex | 574ff77246b |
6000060343403 has 8 divisors (see below), whose sum is σ = 6868325621472. Its totient is φ = 5134573515456.
The previous prime is 6000060343397. The next prime is 6000060343423. The reversal of 6000060343403 is 3043430600006.
6000060343403 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6000060343403 - 222 = 6000056149099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (6000060343423) 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, 694607900 + ... + 694616537.
It is an arithmetic number, because the mean of its divisors is an integer number (858540702684).
Almost surely, 26000060343403 is an apocalyptic number.
6000060343403 is a deficient number, since it is larger than the sum of its proper divisors (868265278069).
6000060343403 is a wasteful number, since it uses less digits than its factorization.
6000060343403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389225061.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 6000060343403 its reverse (3043430600006), we get a palindrome (9043490943409).
It can be divided in two parts, 60000603 and 43403, that added together give a palindrome (60044006).
The spelling of 6000060343403 in words is "six trillion, sixty million, three hundred forty-three thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •