Base | Representation |
---|---|
bin | 10100101100101111101… |
… | …000011011111100100000 |
3 | 12000222112211012201210000 |
4 | 110230233220123330200 |
5 | 141301120411214402 |
6 | 3005242402140000 |
7 | 204524136410514 |
oct | 24545750337440 |
9 | 5028484181700 |
10 | 1422433304352 |
11 | 4a9283576945 |
12 | 1ab816051600 |
13 | a419a45b468 |
14 | 4cbbbb40144 |
15 | 2700282ec1c |
hex | 14b2fa1bf20 |
1422433304352 has 120 divisors (see below), whose sum is σ = 4327590059100. Its totient is φ = 457794602496.
The previous prime is 1422433304333. The next prime is 1422433304429. The reversal of 1422433304352 is 2534033342241.
1422433304352 is a `hidden beast` number, since 1 + 42 + 243 + 330 + 43 + 5 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1422399710736 + 33593616 = 1192644^2 + 5796^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9386527 + ... + 9536862.
Almost surely, 21422433304352 is an apocalyptic number.
1422433304352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1422433304352 is an abundant number, since it is smaller than the sum of its proper divisors (2905156754748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1422433304352 is a wasteful number, since it uses less digits than its factorization.
1422433304352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18923440 (or 18923423 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 36.
Adding to 1422433304352 its reverse (2534033342241), we get a palindrome (3956466646593).
The spelling of 1422433304352 in words is "one trillion, four hundred twenty-two billion, four hundred thirty-three million, three hundred four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •