Base | Representation |
---|---|
bin | 111001000111000001… |
… | …111000010111011110 |
3 | 12212021120200121102210 |
4 | 321013001320113132 |
5 | 2001041212430002 |
6 | 44100502301250 |
7 | 4300411514526 |
oct | 710701702736 |
9 | 185246617383 |
10 | 61321217502 |
11 | 24008257356 |
12 | ba74427826 |
13 | 5a233b37ac |
14 | 2d7a138686 |
15 | 18dd73496c |
hex | e470785de |
61321217502 has 8 divisors (see below), whose sum is σ = 122642435016. Its totient is φ = 20440405832.
The previous prime is 61321217483. The next prime is 61321217513. The reversal of 61321217502 is 20571212316.
It is a sphenic number, since it is the product of 3 distinct primes.
61321217502 is an admirable number.
It is a super-2 number, since 2×613212175022 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 61321217502.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 5110101453 + ... + 5110101464.
It is an arithmetic number, because the mean of its divisors is an integer number (15330304377).
Almost surely, 261321217502 is an apocalyptic number.
61321217502 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61321217502 is a wasteful number, since it uses less digits than its factorization.
61321217502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10220202922.
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 61321217502 its reverse (20571212316), we get a palindrome (81892429818).
The spelling of 61321217502 in words is "sixty-one billion, three hundred twenty-one million, two hundred seventeen thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •