Base | Representation |
---|---|
bin | 1011001010010101101111… |
… | …1000100000110111111001 |
3 | 1121110012212010010221000201 |
4 | 2302211123320200313321 |
5 | 3102032043323343131 |
6 | 42033444433202201 |
7 | 2404433056146661 |
oct | 262453370406771 |
9 | 47405763127021 |
10 | 12272263106041 |
11 | 3a0170164a144 |
12 | 1462544100361 |
13 | 6b0366c816b3 |
14 | 305da309d1a1 |
15 | 16436a4da761 |
hex | b295be20df9 |
12272263106041 has 9 divisors (see below), whose sum is σ = 12285572083759. Its totient is φ = 12258968541736.
The previous prime is 12272263106021. The next prime is 12272263106123. The reversal of 12272263106041 is 14060136227221.
The square root of 12272263106041 is 3503179.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 12183694965225 + 88568140816 = 3490515^2 + 297604^2 .
It is not a de Polignac number, because 12272263106041 - 213 = 12272263097849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12272263106021) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 5545531251 + ... + 5545533463.
Almost surely, 212272263106041 is an apocalyptic number.
12272263106041 is the 3503179-th square number.
12272263106041 is the 1751590-th centered octagonal number.
It is an amenable number.
12272263106041 is a deficient number, since it is larger than the sum of its proper divisors (13308977718).
12272263106041 is an frugal number, since it uses more digits than its factorization.
12272263106041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7592 (or 3796 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 37.
The spelling of 12272263106041 in words is "twelve trillion, two hundred seventy-two billion, two hundred sixty-three million, one hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •