Base | Representation |
---|---|
bin | 1001001110100001111000… |
… | …1111100011000001000111 |
3 | 1022220212120211112222121112 |
4 | 2103220132033203001013 |
5 | 2312204402324121343 |
6 | 33324352204435235 |
7 | 2064653004251012 |
oct | 223503617430107 |
9 | 38825524488545 |
10 | 10145220145223 |
11 | 3261622317569 |
12 | 117a265848b1b |
13 | 5878c8367937 |
14 | 271061b66379 |
15 | 128d790a4218 |
hex | 93a1e3e3047 |
10145220145223 has 4 divisors (see below), whose sum is σ = 10146566208240. Its totient is φ = 10143874082208.
The previous prime is 10145220145201. The next prime is 10145220145241. The reversal of 10145220145223 is 32254102254101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10145220145223 - 230 = 10144146403399 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 10145220145223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145220145273) 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, 673020203 + ... + 673035276.
It is an arithmetic number, because the mean of its divisors is an integer number (2536641552060).
Almost surely, 210145220145223 is an apocalyptic number.
10145220145223 is a deficient number, since it is larger than the sum of its proper divisors (1346063017).
10145220145223 is an equidigital number, since it uses as much as digits as its factorization.
10145220145223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346063016.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 10145220145223 its reverse (32254102254101), we get a palindrome (42399322399324).
The spelling of 10145220145223 in words is "ten trillion, one hundred forty-five billion, two hundred twenty million, one hundred forty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •