Base | Representation |
---|---|
bin | 100001001101100001000… |
… | …1011110011010011110000 |
3 | 121011100210202202120212022 |
4 | 1002123002023303103300 |
5 | 1044241110331021000 |
6 | 13412524113451012 |
7 | 650526614354540 |
oct | 102330213632360 |
9 | 17140722676768 |
10 | 4564513142000 |
11 | 14aa887743549 |
12 | 618772270a68 |
13 | 27157c6cbbc6 |
14 | 11acd0583320 |
15 | 7db00678585 |
hex | 426c22f34f0 |
4564513142000 has 80 divisors (see below), whose sum is σ = 12613706069952. Its totient is φ = 1564975929600.
The previous prime is 4564513141999. The next prime is 4564513142011. The reversal of 4564513142000 is 2413154654.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (35).
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 15 ways as a sum of consecutive naturals, for example, 163004327 + ... + 163032326.
Almost surely, 24564513142000 is an apocalyptic number.
4564513142000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4564513142000 is an abundant number, since it is smaller than the sum of its proper divisors (8049192927952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4564513142000 is a wasteful number, since it uses less digits than its factorization.
4564513142000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326036683 (or 326036667 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 4564513142000 its reverse (2413154654), we get a palindrome (4566926296654).
The spelling of 4564513142000 in words is "four trillion, five hundred sixty-four billion, five hundred thirteen million, one hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •