Base | Representation |
---|---|
bin | 101110001111010011010… |
… | …0011101100100100101101 |
3 | 211111112111102122110020212 |
4 | 1130132212203230210231 |
5 | 1313110121024200003 |
6 | 21303245314152205 |
7 | 1224065042162165 |
oct | 134364643544455 |
9 | 24445442573225 |
10 | 6355051006253 |
11 | 2030186687534 |
12 | 867799882665 |
13 | 371381508401 |
14 | 17d82c3dd5a5 |
15 | b049966add8 |
hex | 5c7a68ec92d |
6355051006253 has 8 divisors (see below), whose sum is σ = 6594042567936. Its totient is φ = 6118183814400.
The previous prime is 6355051006237. The next prime is 6355051006303. The reversal of 6355051006253 is 3526001505536.
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 6355051006253 - 24 = 6355051006237 is a prime.
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 6355051006253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6355051006223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 531086363 + ... + 531098328.
It is an arithmetic number, because the mean of its divisors is an integer number (824255320992).
Almost surely, 26355051006253 is an apocalyptic number.
It is an amenable number.
6355051006253 is a deficient number, since it is larger than the sum of its proper divisors (238991561683).
6355051006253 is a wasteful number, since it uses less digits than its factorization.
6355051006253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062184915.
The product of its (nonzero) digits is 405000, while the sum is 41.
The spelling of 6355051006253 in words is "six trillion, three hundred fifty-five billion, fifty-one million, six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •