Base | Representation |
---|---|
bin | 1101011001001100010… |
… | …1110001110001001011 |
3 | 210222221010200112201212 |
4 | 3112103011301301023 |
5 | 12232221331011021 |
6 | 253412411403335 |
7 | 22424055333554 |
oct | 3262305616113 |
9 | 728833615655 |
10 | 230101032011 |
11 | 89649041064 |
12 | 3871845354b |
13 | 189105c9716 |
14 | b1cbb0932b |
15 | 5ebada885b |
hex | 3593171c4b |
230101032011 has 8 divisors (see below), whose sum is σ = 231538414848. Its totient is φ = 228668121000.
The previous prime is 230101031983. The next prime is 230101032017. The reversal of 230101032011 is 110230101032.
230101032011 is digitally balanced in base 2, 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 a cyclic number.
It is not a de Polignac number, because 230101032011 - 210 = 230101030987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230101032017) 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, 1014695 + ... + 1220576.
It is an arithmetic number, because the mean of its divisors is an integer number (28942301856).
Almost surely, 2230101032011 is an apocalyptic number.
230101032011 is a deficient number, since it is larger than the sum of its proper divisors (1437382837).
230101032011 is a wasteful number, since it uses less digits than its factorization.
230101032011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2235913.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 230101032011 its reverse (110230101032), we get a palindrome (340331133043).
The spelling of 230101032011 in words is "two hundred thirty billion, one hundred one million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •