Base | Representation |
---|---|
bin | 1001001110110011110110… |
… | …1110100101101000111101 |
3 | 1022221100000222020211200211 |
4 | 2103230331232211220331 |
5 | 2312244242043442141 |
6 | 33330510542352421 |
7 | 2065213351620232 |
oct | 223547556455075 |
9 | 38840028224624 |
10 | 10150043343421 |
11 | 3263677946783 |
12 | 117b190b8b711 |
13 | 5881b66a2277 |
14 | 27139c563789 |
15 | 12905c734d81 |
hex | 93b3dba5a3d |
10150043343421 has 4 divisors (see below), whose sum is σ = 10154382825600. Its totient is φ = 10145703861244.
The previous prime is 10150043343373. The next prime is 10150043343437. The reversal of 10150043343421 is 12434334005101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10150043343421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150043343491) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2169737581 + ... + 2169742258.
It is an arithmetic number, because the mean of its divisors is an integer number (2538595706400).
Almost surely, 210150043343421 is an apocalyptic number.
It is an amenable number.
10150043343421 is a deficient number, since it is larger than the sum of its proper divisors (4339482179).
10150043343421 is an equidigital number, since it uses as much as digits as its factorization.
10150043343421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4339482178.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 10150043343421 its reverse (12434334005101), we get a palindrome (22584377348522).
The spelling of 10150043343421 in words is "ten trillion, one hundred fifty billion, forty-three million, three hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •