Base | Representation |
---|---|
bin | 1101100001110101100… |
… | …0100100011110010111 |
3 | 211012220211112000012221 |
4 | 3120131120210132113 |
5 | 12301444312322403 |
6 | 254434533123211 |
7 | 22535420503051 |
oct | 3303530443627 |
9 | 735824460187 |
10 | 232421214103 |
11 | 8a629797221 |
12 | 39065489507 |
13 | 18bc01b9b30 |
14 | b36bd0c8d1 |
15 | 60a4914dbd |
hex | 361d624797 |
232421214103 has 8 divisors (see below), whose sum is σ = 250318832400. Its totient is φ = 214526319168.
The previous prime is 232421214073. The next prime is 232421214133. The reversal of 232421214103 is 301412124232.
It is an interprime number because it is at equal distance from previous prime (232421214073) and next prime (232421214133).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232421214103 - 213 = 232421205911 is a prime.
It is a super-2 number, since 2×2324212141032 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232421214133) 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, 501838 + ... + 846571.
It is an arithmetic number, because the mean of its divisors is an integer number (31289854050).
Almost surely, 2232421214103 is an apocalyptic number.
232421214103 is a deficient number, since it is larger than the sum of its proper divisors (17897618297).
232421214103 is a wasteful number, since it uses less digits than its factorization.
232421214103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1361681.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 232421214103 its reverse (301412124232), we get a palindrome (533833338335).
The spelling of 232421214103 in words is "two hundred thirty-two billion, four hundred twenty-one million, two hundred fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •