Base | Representation |
---|---|
bin | 111010111101000111010… |
… | …010010001010100100111 |
3 | 112100022020120000200111011 |
4 | 322331013102101110213 |
5 | 1012334131113211012 |
6 | 12341055313323051 |
7 | 565462142633563 |
oct | 72750722212447 |
9 | 15308216020434 |
10 | 4051350132007 |
11 | 13221935928a2 |
12 | 555218b66487 |
13 | 23506b4a6929 |
14 | 10012d0c06a3 |
15 | 705b91441a7 |
hex | 3af47491527 |
4051350132007 has 4 divisors (see below), whose sum is σ = 4060750016736. Its totient is φ = 4041950247280.
The previous prime is 4051350132001. The next prime is 4051350132083. The reversal of 4051350132007 is 7002310531504.
It is a happy number.
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 4051350132007 - 215 = 4051350099239 is a prime.
It is a super-2 number, since 2×40513501320072 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4051350132007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4051350132001) 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, 4699941718 + ... + 4699942579.
It is an arithmetic number, because the mean of its divisors is an integer number (1015187504184).
Almost surely, 24051350132007 is an apocalyptic number.
4051350132007 is a deficient number, since it is larger than the sum of its proper divisors (9399884729).
4051350132007 is an equidigital number, since it uses as much as digits as its factorization.
4051350132007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9399884728.
The product of its (nonzero) digits is 12600, while the sum is 31.
The spelling of 4051350132007 in words is "four trillion, fifty-one billion, three hundred fifty million, one hundred thirty-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •