Base | Representation |
---|---|
bin | 110111010011010100010011… |
… | …100011001111100011000100 |
3 | 1011220011121102010222211012011 |
4 | 313103110103203033203010 |
5 | 223334404110414323022 |
6 | 2221141423441304004 |
7 | 102142032050355436 |
oct | 6723242343174304 |
9 | 1156147363884164 |
10 | 243220031011012 |
11 | 70552043855350 |
12 | 23341808335004 |
13 | a59372061a533 |
14 | 440bcab552656 |
15 | 1d1baa02b8977 |
hex | dd35138cf8c4 |
243220031011012 has 24 divisors (see below), whose sum is σ = 464330049023232. Its totient is φ = 110554345524000.
The previous prime is 243220031010989. The next prime is 243220031011033. The reversal of 243220031011012 is 210110130022342.
243220031011012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18867262 + ... + 29024362.
It is an arithmetic number, because the mean of its divisors is an integer number (19347085375968).
Almost surely, 2243220031011012 is an apocalyptic number.
243220031011012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
243220031011012 is a deficient number, since it is larger than the sum of its proper divisors (221110018012220).
243220031011012 is a wasteful number, since it uses less digits than its factorization.
243220031011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10701339 (or 10701337 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 243220031011012 its reverse (210110130022342), we get a palindrome (453330161033354).
The spelling of 243220031011012 in words is "two hundred forty-three trillion, two hundred twenty billion, thirty-one million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •