Base | Representation |
---|---|
bin | 1101011000110100100… |
… | …0101011111100111001 |
3 | 210222200011201001202022 |
4 | 3112031020223330321 |
5 | 12232020242200241 |
6 | 253354442244225 |
7 | 22421433234113 |
oct | 3261510537471 |
9 | 728604631668 |
10 | 230001131321 |
11 | 895a7708205 |
12 | 386aaab6675 |
13 | 188c59bc1a0 |
14 | b1bc7423b3 |
15 | 5eb222354b |
hex | 358d22bf39 |
230001131321 has 16 divisors (see below), whose sum is σ = 262281172608. Its totient is φ = 199806700800.
The previous prime is 230001131309. The next prime is 230001131377. The reversal of 230001131321 is 123131100032.
It is a cyclic number.
It is not a de Polignac number, because 230001131321 - 26 = 230001131257 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 230001131321.
It is not an unprimeable number, because it can be changed into a prime (230001133321) 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, 4858556 + ... + 4905666.
It is an arithmetic number, because the mean of its divisors is an integer number (16392573288).
Almost surely, 2230001131321 is an apocalyptic number.
It is an amenable number.
230001131321 is a deficient number, since it is larger than the sum of its proper divisors (32280041287).
230001131321 is a wasteful number, since it uses less digits than its factorization.
230001131321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69232.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 230001131321 its reverse (123131100032), we get a palindrome (353132231353).
It can be divided in two parts, 2300011 and 31321, that added together give a palindrome (2331332).
The spelling of 230001131321 in words is "two hundred thirty billion, one million, one hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •