Base | Representation |
---|---|
bin | 11011111101111000111000… |
… | …101000010111110000111001 |
3 | 121010111201002001122210221222 |
4 | 123331320320220113300321 |
5 | 112110213424210430131 |
6 | 1113333304515241425 |
7 | 34623321126336314 |
oct | 3375707050276071 |
9 | 533451061583858 |
10 | 123000223530041 |
11 | 36212113634360 |
12 | 11966325ba9275 |
13 | 5382b43361c70 |
14 | 225335791197b |
15 | e347b880087b |
hex | 6fde38a17c39 |
123000223530041 has 16 divisors (see below), whose sum is σ = 153003980239488. Its totient is φ = 97145384275200.
The previous prime is 123000223529951. The next prime is 123000223530043. The reversal of 123000223530041 is 140035322000321.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 123000223530041 - 210 = 123000223529017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123000223530043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25298274725 + ... + 25298279586.
It is an arithmetic number, because the mean of its divisors is an integer number (9562748764968).
Almost surely, 2123000223530041 is an apocalyptic number.
123000223530041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
123000223530041 is a deficient number, since it is larger than the sum of its proper divisors (30003756709447).
123000223530041 is a wasteful number, since it uses less digits than its factorization.
123000223530041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50596554352.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 123000223530041 its reverse (140035322000321), we get a palindrome (263035545530362).
The spelling of 123000223530041 in words is "one hundred twenty-three trillion, two hundred twenty-three million, five hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •