Base | Representation |
---|---|
bin | 110100111000011111100100… |
… | …0000101110011001001010100 |
3 | 2020222222222100211001100101010 |
4 | 1221300333020011303021110 |
5 | 441432200114201201400 |
6 | 4325152034421532220 |
7 | 166656534112256151 |
oct | 15160771005631124 |
9 | 2228888324040333 |
10 | 465161200022100 |
11 | 12523a83675981a |
12 | 44207434874070 |
13 | 16c72688c2b65a |
14 | 82c1cca775228 |
15 | 38b9d9c3d2450 |
hex | 1a70fc8173254 |
465161200022100 has 144 divisors (see below), whose sum is σ = 1346455246973760. Its totient is φ = 123988727961600.
The previous prime is 465161200022089. The next prime is 465161200022173. The reversal of 465161200022100 is 1220002161564.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6855391774 + ... + 6855459626.
It is an arithmetic number, because the mean of its divisors is an integer number (9350383659540).
Almost surely, 2465161200022100 is an apocalyptic number.
It is an amenable number.
465161200022100 is an abundant number, since it is smaller than the sum of its proper divisors (881294046951660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465161200022100 is a wasteful number, since it uses less digits than its factorization.
465161200022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77530 (or 77523 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 465161200022100 its reverse (1220002161564), we get a palindrome (466381202183664).
The spelling of 465161200022100 in words is "four hundred sixty-five trillion, one hundred sixty-one billion, two hundred million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •