Base | Representation |
---|---|
bin | 1001011000001000100110… |
… | …1110001101000010011101 |
3 | 1100111122111210122212102222 |
4 | 2112002021232031002131 |
5 | 2322410323404213041 |
6 | 33532242155355125 |
7 | 2112614106605156 |
oct | 226021156150235 |
9 | 40448453585388 |
10 | 10310232101021 |
11 | 33155aa263256 |
12 | 11a6237a52aa5 |
13 | 59a334a8ac78 |
14 | 27903717092d |
15 | 12d2d5a5a74b |
hex | 96089b8d09d |
10310232101021 has 8 divisors (see below), whose sum is σ = 10646686220544. Its totient is φ = 9974019605760.
The previous prime is 10310232101017. The next prime is 10310232101069. The reversal of 10310232101021 is 12010123201301.
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 10310232101021 - 22 = 10310232101017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310232101921) 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 in 7 ways as a sum of consecutive naturals, for example, 60319331 + ... + 60490016.
It is an arithmetic number, because the mean of its divisors is an integer number (1330835777568).
Almost surely, 210310232101021 is an apocalyptic number.
It is an amenable number.
10310232101021 is a deficient number, since it is larger than the sum of its proper divisors (336454119523).
10310232101021 is a wasteful number, since it uses less digits than its factorization.
10310232101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120812131.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10310232101021 its reverse (12010123201301), we get a palindrome (22320355302322).
The spelling of 10310232101021 in words is "ten trillion, three hundred ten billion, two hundred thirty-two million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •