Base | Representation |
---|---|
bin | 100001110101110110010… |
… | …0000011111000010101000 |
3 | 121110122100201122112021021 |
4 | 1003223230200133002220 |
5 | 1102200444333144000 |
6 | 13520410214022224 |
7 | 660014103251140 |
oct | 103535440370250 |
9 | 17418321575237 |
10 | 4651122553000 |
11 | 1533591476970 |
12 | 631503647974 |
13 | 2797a2c41ab1 |
14 | 121189043920 |
15 | 80ebe00b11a |
hex | 43aec81f0a8 |
4651122553000 has 128 divisors (see below), whose sum is σ = 13569197241600. Its totient is φ = 1449700512000.
The previous prime is 4651122552991. The next prime is 4651122553001. The reversal of 4651122553000 is 3552211564.
It is not an unprimeable number, because it can be changed into a prime (4651122553001) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 30125095 + ... + 30279094.
It is an arithmetic number, because the mean of its divisors is an integer number (106009353450).
Almost surely, 24651122553000 is an apocalyptic number.
4651122553000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4651122553000 is an abundant number, since it is smaller than the sum of its proper divisors (8918074688600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4651122553000 is a wasteful number, since it uses less digits than its factorization.
4651122553000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60404228 (or 60404214 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 4651122553000 its reverse (3552211564), we get a palindrome (4654674764564).
The spelling of 4651122553000 in words is "four trillion, six hundred fifty-one billion, one hundred twenty-two million, five hundred fifty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •