Base | Representation |
---|---|
bin | 10100100110011… |
… | …110101010100001 |
3 | 220002100220010201 |
4 | 110212132222201 |
5 | 1201440201033 |
6 | 54144025201 |
7 | 11364550462 |
oct | 2446365241 |
9 | 802326121 |
10 | 345631393 |
11 | 168110a88 |
12 | 97902201 |
13 | 567b6923 |
14 | 33c90d69 |
15 | 2052447d |
hex | 1499eaa1 |
345631393 has 8 divisors (see below), whose sum is σ = 358491240. Its totient is φ = 332956800.
The previous prime is 345631387. The next prime is 345631427. The reversal of 345631393 is 393136543.
It can be written as a sum of positive squares in 4 ways, for example, as 251793424 + 93837969 = 15868^2 + 9687^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 345631393 - 25 = 345631361 is a prime.
It is a super-2 number, since 2×3456313932 = 238922119654240898, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (345631313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42508 + ... + 49981.
It is an arithmetic number, because the mean of its divisors is an integer number (44811405).
Almost surely, 2345631393 is an apocalyptic number.
It is an amenable number.
345631393 is a deficient number, since it is larger than the sum of its proper divisors (12859847).
345631393 is a wasteful number, since it uses less digits than its factorization.
345631393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92627.
The product of its digits is 87480, while the sum is 37.
The square root of 345631393 is about 18591.1643798876. The cubic root of 345631393 is about 701.7855050668.
The spelling of 345631393 in words is "three hundred forty-five million, six hundred thirty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •