Base | Representation |
---|---|
bin | 1001000111110101011111… |
… | …1001000101110101001011 |
3 | 1022111212202111112220112111 |
4 | 2101331113321011311023 |
5 | 2303313344121020133 |
6 | 33155453153323151 |
7 | 2053442165440405 |
oct | 221752771056513 |
9 | 38455674486474 |
10 | 10030223220043 |
11 | 321788057a624 |
12 | 115bb115664b7 |
13 | 579acc847890 |
14 | 269673081b75 |
15 | 125d984611cd |
hex | 91f57e45d4b |
10030223220043 has 16 divisors (see below), whose sum is σ = 11286078914880. Its totient is φ = 8844600213504.
The previous prime is 10030223220037. The next prime is 10030223220077. The reversal of 10030223220043 is 34002232203001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10030223220043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10030223219996 and 10030223220023.
It is not an unprimeable number, because it can be changed into a prime (10030223220023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21581446 + ... + 22041307.
It is an arithmetic number, because the mean of its divisors is an integer number (705379932180).
Almost surely, 210030223220043 is an apocalyptic number.
10030223220043 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10030223220043 is a deficient number, since it is larger than the sum of its proper divisors (1255855694837).
10030223220043 is a wasteful number, since it uses less digits than its factorization.
10030223220043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43623558.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 10030223220043 its reverse (34002232203001), we get a palindrome (44032455423044).
The spelling of 10030223220043 in words is "ten trillion, thirty billion, two hundred twenty-three million, two hundred twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •