Base | Representation |
---|---|
bin | 1101011001010011110… |
… | …1000110000100111010 |
3 | 211000000022112122112010 |
4 | 3112110331012010322 |
5 | 12232302332412310 |
6 | 253415450030350 |
7 | 22424615235156 |
oct | 3262475060472 |
9 | 730008478463 |
10 | 230132310330 |
11 | 89664764a0a |
12 | 38726a183b6 |
13 | 18916c2b4c0 |
14 | b1d1d2c066 |
15 | 5ebd9d6320 |
hex | 3594f4613a |
230132310330 has 64 divisors (see below), whose sum is σ = 595010360448. Its totient is φ = 56628253440.
The previous prime is 230132310311. The next prime is 230132310337. The reversal of 230132310330 is 33013231032.
230132310330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 230132310297 and 230132310306.
It is not an unprimeable number, because it can be changed into a prime (230132310337) 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 31 ways as a sum of consecutive naturals, for example, 1036485 + ... + 1238775.
It is an arithmetic number, because the mean of its divisors is an integer number (9297036882).
Almost surely, 2230132310330 is an apocalyptic number.
230132310330 is an abundant number, since it is smaller than the sum of its proper divisors (364878050118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230132310330 is a wasteful number, since it uses less digits than its factorization.
230132310330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205231.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 230132310330 its reverse (33013231032), we get a palindrome (263145541362).
The spelling of 230132310330 in words is "two hundred thirty billion, one hundred thirty-two million, three hundred ten thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •