Base | Representation |
---|---|
bin | 1101011001010001010… |
… | …1110110010100111001 |
3 | 210222222121011221212022 |
4 | 3112110111312110321 |
5 | 12232242214202301 |
6 | 253414441324225 |
7 | 22424431625501 |
oct | 3262425662471 |
9 | 728877157768 |
10 | 230122022201 |
11 | 89659978325 |
12 | 38723496675 |
13 | 18914a68756 |
14 | b1d0810a01 |
15 | 5ebcb52d1b |
hex | 3594576539 |
230122022201 has 8 divisors (see below), whose sum is σ = 242258371200. Its totient is φ = 217988139600.
The previous prime is 230122022173. The next prime is 230122022203. The reversal of 230122022201 is 102220221032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230122022201 is a prime.
It is a super-2 number, since 2×2301220222012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230122022201.
It is not an unprimeable number, because it can be changed into a prime (230122022203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 423521 + ... + 799758.
It is an arithmetic number, because the mean of its divisors is an integer number (30282296400).
Almost surely, 2230122022201 is an apocalyptic number.
It is an amenable number.
230122022201 is a deficient number, since it is larger than the sum of its proper divisors (12136348999).
230122022201 is a wasteful number, since it uses less digits than its factorization.
230122022201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1233199.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 230122022201 its reverse (102220221032), we get a palindrome (332342243233).
The spelling of 230122022201 in words is "two hundred thirty billion, one hundred twenty-two million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •