Base | Representation |
---|---|
bin | 1001001000010111000001… |
… | …0010001110101111111111 |
3 | 1022112201222200002111211222 |
4 | 2102011300102032233333 |
5 | 2303440311413213301 |
6 | 33203542145103555 |
7 | 2054211201255605 |
oct | 222056022165777 |
9 | 38481880074758 |
10 | 10039222397951 |
11 | 322067935a13a |
12 | 1161803327bbb |
13 | 57a90509a916 |
14 | 269c88321875 |
15 | 12622352931b |
hex | 9217048ebff |
10039222397951 has 4 divisors (see below), whose sum is σ = 10039437698400. Its totient is φ = 10039007097504.
The previous prime is 10039222397927. The next prime is 10039222397977. The reversal of 10039222397951 is 15979322293001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10039222397951 - 222 = 10039218203647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10039222397893 and 10039222397902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10039222397921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107580266 + ... + 107673543.
It is an arithmetic number, because the mean of its divisors is an integer number (2509859424600).
Almost surely, 210039222397951 is an apocalyptic number.
10039222397951 is a deficient number, since it is larger than the sum of its proper divisors (215300449).
10039222397951 is an equidigital number, since it uses as much as digits as its factorization.
10039222397951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215300448.
The product of its (nonzero) digits is 1837080, while the sum is 53.
The spelling of 10039222397951 in words is "ten trillion, thirty-nine billion, two hundred twenty-two million, three hundred ninety-seven thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •