Base | Representation |
---|---|
bin | 1001010011000101010010… |
… | …0100111001001111000011 |
3 | 1100012100111012010022212111 |
4 | 2110301110210321033003 |
5 | 2320000101411402433 |
6 | 33424330051440151 |
7 | 2103422254503466 |
oct | 224612444711703 |
9 | 40170435108774 |
10 | 10223441122243 |
11 | 3291811a97318 |
12 | 11914558b6057 |
13 | 5920b2a4571b |
14 | 274b625292dd |
15 | 12ae062aedcd |
hex | 94c549393c3 |
10223441122243 has 8 divisors (see below), whose sum is σ = 10422334008000. Its totient is φ = 10026285292608.
The previous prime is 10223441122201. The next prime is 10223441122247. The reversal of 10223441122243 is 34222114432201.
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-10223441122243 is a prime.
It is a super-2 number, since 2×102234411222432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10223441122247) 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, 434252146 + ... + 434275687.
It is an arithmetic number, because the mean of its divisors is an integer number (1302791751000).
Almost surely, 210223441122243 is an apocalyptic number.
10223441122243 is a deficient number, since it is larger than the sum of its proper divisors (198892885757).
10223441122243 is an equidigital number, since it uses as much as digits as its factorization.
10223441122243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 868528061.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 10223441122243 its reverse (34222114432201), we get a palindrome (44445555554444).
The spelling of 10223441122243 in words is "ten trillion, two hundred twenty-three billion, four hundred forty-one million, one hundred twenty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •