Base | Representation |
---|---|
bin | 1101100001100000010… |
… | …0101000111000111111 |
3 | 211012200121211201002021 |
4 | 3120120010220320333 |
5 | 12301304004300411 |
6 | 254422031141011 |
7 | 22533256202434 |
oct | 3303004507077 |
9 | 735617751067 |
10 | 232332103231 |
11 | 8a593462978 |
12 | 3903b674767 |
13 | 18ba78b97c7 |
14 | b360153b8b |
15 | 609bbb1a71 |
hex | 3618128e3f |
232332103231 has 8 divisors (see below), whose sum is σ = 233215580304. Its totient is φ = 231449573760.
The previous prime is 232332103109. The next prime is 232332103249. The reversal of 232332103231 is 132301233232.
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 232332103231 - 29 = 232332102719 is a prime.
It is a super-2 number, since 2×2323321032312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232332103196 and 232332103205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232332103291) 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, 256336 + ... + 728266.
It is an arithmetic number, because the mean of its divisors is an integer number (29151947538).
Almost surely, 2232332103231 is an apocalyptic number.
232332103231 is a deficient number, since it is larger than the sum of its proper divisors (883477073).
232332103231 is a wasteful number, since it uses less digits than its factorization.
232332103231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 473801.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 232332103231 its reverse (132301233232), we get a palindrome (364633336463).
The spelling of 232332103231 in words is "two hundred thirty-two billion, three hundred thirty-two million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •