Base | Representation |
---|---|
bin | 10010111111010001100… |
… | …00011000111110001001 |
3 | 2022101002000111012020221 |
4 | 21133220300120332021 |
5 | 41142201413423001 |
6 | 1215421253550041 |
7 | 65065124341336 |
oct | 11375060307611 |
9 | 2271060435227 |
10 | 652445061001 |
11 | 231778256118 |
12 | a6546645321 |
13 | 496aa132196 |
14 | 2381560398d |
15 | 11e891da1a1 |
hex | 97e8c18f89 |
652445061001 has 4 divisors (see below), whose sum is σ = 673491675904. Its totient is φ = 631398446100.
The previous prime is 652445060999. The next prime is 652445061013. The reversal of 652445061001 is 100160544256.
652445061001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 652445061001 - 21 = 652445060999 is a prime.
It is a super-2 number, since 2×6524450610012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (652445061901) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10523307405 + ... + 10523307466.
It is an arithmetic number, because the mean of its divisors is an integer number (168372918976).
Almost surely, 2652445061001 is an apocalyptic number.
It is an amenable number.
652445061001 is a deficient number, since it is larger than the sum of its proper divisors (21046614903).
652445061001 is a wasteful number, since it uses less digits than its factorization.
652445061001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21046614902.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 652445061001 in words is "six hundred fifty-two billion, four hundred forty-five million, sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •