Base | Representation |
---|---|
bin | 1101011011001001100… |
… | …1001101110110000010 |
3 | 211001021201220221012021 |
4 | 3112302121031312002 |
5 | 12234310303041232 |
6 | 253540452152054 |
7 | 22443063352231 |
oct | 3266231156602 |
9 | 731251827167 |
10 | 230626221442 |
11 | 89898542711 |
12 | 3884430862a |
13 | 18995360cb6 |
14 | b23b77ab18 |
15 | 5eec04a397 |
hex | 35b264dd82 |
230626221442 has 8 divisors (see below), whose sum is σ = 350107276176. Its totient is φ = 113923796052.
The previous prime is 230626221433. The next prime is 230626221467. The reversal of 230626221442 is 244122626032.
230626221442 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 super-2 number, since 2×2306262214422 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230626221398 and 230626221407.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 694657128 + ... + 694657459.
It is an arithmetic number, because the mean of its divisors is an integer number (43763409522).
Almost surely, 2230626221442 is an apocalyptic number.
230626221442 is a deficient number, since it is larger than the sum of its proper divisors (119481054734).
230626221442 is a wasteful number, since it uses less digits than its factorization.
230626221442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389314672.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 230626221442 its reverse (244122626032), we get a palindrome (474748847474).
The spelling of 230626221442 in words is "two hundred thirty billion, six hundred twenty-six million, two hundred twenty-one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •