Base | Representation |
---|---|
bin | 10000100110110101011… |
… | …111010010101010010001 |
3 | 11001002122222020021022222 |
4 | 100212311133102222101 |
5 | 122144200032244213 |
6 | 2232133140510425 |
7 | 145310164152635 |
oct | 20466537225221 |
9 | 4032588207288 |
10 | 1141211212433 |
11 | 3aaa91a83946 |
12 | 1652113ab415 |
13 | 83800a79686 |
14 | 3d340882dc5 |
15 | 1ea4398a808 |
hex | 109b57d2a91 |
1141211212433 has 8 divisors (see below), whose sum is σ = 1151888011560. Its totient is φ = 1130538176640.
The previous prime is 1141211212429. The next prime is 1141211212439. The reversal of 1141211212433 is 3342121121411.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 244142715664 + 897068496769 = 494108^2 + 947137^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1141211212433 - 22 = 1141211212429 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1141211212439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 329660 + ... + 1546317.
It is an arithmetic number, because the mean of its divisors is an integer number (143986001445).
Almost surely, 21141211212433 is an apocalyptic number.
It is an amenable number.
1141211212433 is a deficient number, since it is larger than the sum of its proper divisors (10676799127).
1141211212433 is a wasteful number, since it uses less digits than its factorization.
1141211212433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1881667.
The product of its digits is 1152, while the sum is 26.
Adding to 1141211212433 its reverse (3342121121411), we get a palindrome (4483332333844).
The spelling of 1141211212433 in words is "one trillion, one hundred forty-one billion, two hundred eleven million, two hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •