Base | Representation |
---|---|
bin | 11011110011110001001001… |
… | …11110000110101101010111 |
3 | 22000112002221102201122000201 |
4 | 31321320210332012231113 |
5 | 31003410020320330011 |
6 | 334021001455321331 |
7 | 15611053413540424 |
oct | 1571704476065527 |
9 | 260462842648021 |
10 | 61152364620631 |
11 | 18537632653679 |
12 | 6a378a3220247 |
13 | 281784927578b |
14 | 1115b0c5c0d4b |
15 | 710aa77d1cc1 |
hex | 379e24f86b57 |
61152364620631 has 16 divisors (see below), whose sum is σ = 65147563353600. Its totient is φ = 57234854786688.
The previous prime is 61152364620583. The next prime is 61152364620679. The reversal of 61152364620631 is 13602646325116.
It is an interprime number because it is at equal distance from previous prime (61152364620583) and next prime (61152364620679).
It is a cyclic number.
It is not a de Polignac number, because 61152364620631 - 29 = 61152364620119 is a prime.
It is a super-2 number, since 2×611523646206312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61152364620031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 103533615 + ... + 104122591.
It is an arithmetic number, because the mean of its divisors is an integer number (4071722709600).
Almost surely, 261152364620631 is an apocalyptic number.
61152364620631 is a deficient number, since it is larger than the sum of its proper divisors (3995198732969).
61152364620631 is a wasteful number, since it uses less digits than its factorization.
61152364620631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654918.
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 61152364620631 in words is "sixty-one trillion, one hundred fifty-two billion, three hundred sixty-four million, six hundred twenty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •