Base | Representation |
---|---|
bin | 1101100100000101100… |
… | …0010010100011000101 |
3 | 211021110220212121222210 |
4 | 3121001120102203011 |
5 | 12304213412323303 |
6 | 255014505014033 |
7 | 22556402562006 |
oct | 3310130224305 |
9 | 737426777883 |
10 | 233025120453 |
11 | 8a909672a84 |
12 | 391b3784319 |
13 | 18c88352778 |
14 | b3c81d11ad |
15 | 60dc955203 |
hex | 36416128c5 |
233025120453 has 4 divisors (see below), whose sum is σ = 310700160608. Its totient is φ = 155350080300.
The previous prime is 233025120407. The next prime is 233025120469. The reversal of 233025120453 is 354021520332.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 233025120453 - 29 = 233025119941 is a prime.
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 233025120453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233025120553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38837520073 + ... + 38837520078.
It is an arithmetic number, because the mean of its divisors is an integer number (77675040152).
Almost surely, 2233025120453 is an apocalyptic number.
It is an amenable number.
233025120453 is a deficient number, since it is larger than the sum of its proper divisors (77675040155).
233025120453 is an equidigital number, since it uses as much as digits as its factorization.
233025120453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77675040154.
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 233025120453 its reverse (354021520332), we get a palindrome (587046640785).
The spelling of 233025120453 in words is "two hundred thirty-three billion, twenty-five million, one hundred twenty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •