Base | Representation |
---|---|
bin | 1100010000001111001… |
… | …10100000111101100010 |
3 | 1111020202121101011000020 |
4 | 12020013212200331202 |
5 | 23344234242111002 |
6 | 521230454534310 |
7 | 42263423526054 |
oct | 6100746407542 |
9 | 1436677334006 |
10 | 421034332002 |
11 | 1526179a4359 |
12 | 69723667396 |
13 | 3091b3b3b3b |
14 | 165419b18d4 |
15 | ae433782bc |
hex | 62079a0f62 |
421034332002 has 8 divisors (see below), whose sum is σ = 842068664016. Its totient is φ = 140344777332.
The previous prime is 421034331979. The next prime is 421034332007. The reversal of 421034332002 is 200233430124.
It is a sphenic number, since it is the product of 3 distinct primes.
421034332002 is an admirable number.
It is a super-2 number, since 2×4210343320022 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (421034332007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35086194328 + ... + 35086194339.
It is an arithmetic number, because the mean of its divisors is an integer number (105258583002).
Almost surely, 2421034332002 is an apocalyptic number.
421034332002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421034332002 is a wasteful number, since it uses less digits than its factorization.
421034332002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70172388672.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 421034332002 its reverse (200233430124), we get a palindrome (621267762126).
The spelling of 421034332002 in words is "four hundred twenty-one billion, thirty-four million, three hundred thirty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •