Base | Representation |
---|---|
bin | 111001010010101011… |
… | …0100001111010011001 |
3 | 102202120101201201012101 |
4 | 1302211112201322121 |
5 | 4003433001343001 |
6 | 132304245043401 |
7 | 11613610131322 |
oct | 1624526417231 |
9 | 382511651171 |
10 | 123033231001 |
11 | 481a60624aa |
12 | 1ba176b6561 |
13 | b7a9735405 |
14 | 5d5211d449 |
15 | 3301410a01 |
hex | 1ca55a1e99 |
123033231001 has 8 divisors (see below), whose sum is σ = 125384112000. Its totient is φ = 120683442672.
The previous prime is 123033230989. The next prime is 123033231017. The reversal of 123033231001 is 100132330321.
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-123033231001 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 123033231001.
It is not an unprimeable number, because it can be changed into a prime (123033237001) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 44001 + ... + 497998.
It is an arithmetic number, because the mean of its divisors is an integer number (15673014000).
Almost surely, 2123033231001 is an apocalyptic number.
It is an amenable number.
123033231001 is a deficient number, since it is larger than the sum of its proper divisors (2350880999).
123033231001 is an equidigital number, since it uses as much as digits as its factorization.
123033231001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546335.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 123033231001 its reverse (100132330321), we get a palindrome (223165561322).
The spelling of 123033231001 in words is "one hundred twenty-three billion, thirty-three million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •