Base | Representation |
---|---|
bin | 110000000000000000110110… |
… | …1111110110001111100000000 |
3 | 2001100221021221020002200002221 |
4 | 1200000001231332301330000 |
5 | 420320024401410140000 |
6 | 4053550324302220424 |
7 | 154634656130313535 |
oct | 14000015576617400 |
9 | 2040837836080087 |
10 | 422214310240000 |
11 | 1125920a1031843 |
12 | 3b42bb66284714 |
13 | 1517883c068845 |
14 | 76393d2bcad8c |
15 | 33c2b6a8cc61a |
hex | 180006dfb1f00 |
422214310240000 has 90 divisors (see below), whose sum is σ = 1053137070949040. Its totient is φ = 168885724032000.
The previous prime is 422214310239949. The next prime is 422214310240027. The reversal of 422214310240000 is 42013412224.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1319259720 + ... + 1319579719.
Almost surely, 2422214310240000 is an apocalyptic number.
422214310240000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
422214310240000 is an abundant number, since it is smaller than the sum of its proper divisors (630922760709040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
422214310240000 is an frugal number, since it uses more digits than its factorization.
422214310240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2638839475 (or 2638839446 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 422214310240000 its reverse (42013412224), we get a palindrome (422256323652224).
The spelling of 422214310240000 in words is "four hundred twenty-two trillion, two hundred fourteen billion, three hundred ten million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •