Base | Representation |
---|---|
bin | 110100010111011111110010… |
… | …100101110100010000001000 |
3 | 1010012110201101000200111121122 |
4 | 310113133302211310100020 |
5 | 220141422212414004112 |
6 | 2133500213400254412 |
7 | 66340400232165323 |
oct | 6427376245642010 |
9 | 1105421330614548 |
10 | 230313101313032 |
11 | 67426268494031 |
12 | 219b827b771408 |
13 | 9b685808b1a5a |
14 | 40c32dc0d17ba |
15 | 1b95e8b7dc872 |
hex | d177f2974408 |
230313101313032 has 128 divisors (see below), whose sum is σ = 450636948720000. Its totient is φ = 110271448995840.
The previous prime is 230313101312993. The next prime is 230313101313037.
230313101313032 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 230313101312992 and 230313101313010.
It is not an unprimeable number, because it can be changed into a prime (230313101313037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2075978219 + ... + 2076089157.
It is an arithmetic number, because the mean of its divisors is an integer number (3520601161875).
Almost surely, 2230313101313032 is an apocalyptic number.
It is an amenable number.
230313101313032 is a deficient number, since it is larger than the sum of its proper divisors (220323847406968).
230313101313032 is a wasteful number, since it uses less digits than its factorization.
230313101313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111639 (or 111635 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
It can be divided in two parts, 23031310 and 1313032, that added together give a palindrome (24344342).
The spelling of 230313101313032 in words is "two hundred thirty trillion, three hundred thirteen billion, one hundred one million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •